Filters
The buffer minimization problem for multiprocessor scheduling with conflicts
The buffer minimization problem for multiprocessor scheduling with conflicts...
BA - Obecná matematika
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
PL1 P - Point-Line Minimal Problems Under Partial Visibility in Three Views
We present a complete classification of minimal problems for generic of interesting minimal problems that allows missing observations in images due to occlusions and missed detections. There is an infinite number o...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
A description of the branch and bound algorithm to solve minimal perturbation problems.
JC - Počítačový hardware a software
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
PLMP – Point-Line Minimal Problems in Complete Multi-View Visibility
We present a complete classification of all minimal problems for generic show that there are only 30 minimal problems in total, no problems exist for more. For all minimal problems discov...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2024 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Convergence of generalized entropy minimizers in sequences of convex problems
Integral functionals based on convex normal integrands are minimized over convex constraint sets. Generalized minimizers exist under a boundedness condition. Sequences of the minimization problems are studied when ...
BA - Obecná matematika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Minimal Perturbation Problem A Formal View
A description of formal framework for modelling constraint satisfaction problems changing in time.
JC - Počítačový hardware a software
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
Minimal Perturbation Problem A Formal View
Description of formal framework for modelling constraint satisfaction problems evolving in time.
JC - Počítačový hardware a software
- 2003 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A New Approach to Modelling and Solving Minimal Perturbation Problems
A new frameform for modelling constraint satisfaction problems evolving in time, algorithm for solving such problems.
JC - Počítačový hardware a software
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A New Labeling Algorithm to Solve Minimal Perturbation Problems: A Preliminary Report
the problem constraints. This change requires producing a new solution which satisfies theseconstraints but not being too far from the original solution. This type of problem is called a minimal perturbation problem
IN - Informatika
- 2003 •
- D
Rok uplatnění
D - Stať ve sborníku
PLMP – Point-Line Minimal Problems in Complete Multi-View Visibility
We present a complete classification of all minimal problems for generic show that there are only 30 minimal problems in total, no problems exist for more. For all minimal problems discov...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 109 320