5889 search results - page 1012 / 1178 » Graph Layout Problems |
139
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
130
click to vote
NIPS
2003
15 years 3 months ago
2003
The detection and pose estimation of people in images and video is made challenging by the variability of human appearance, the complexity of natural scenes, and the high dimensio...
100
Voted
AAAI
1998
15 years 3 months ago
1998
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
119
click to vote
UAI
2003
15 years 3 months ago
2003
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
125
click to vote
SODA
2000
ACM
15 years 3 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...