10608 search results - page 1805 / 2122 » Complexity of O'Hara's Algorithm |
IEAAIE
2001
Springer
15 years 5 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
99
Voted
ISRR
2001
Springer
15 years 5 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
112
Voted
TACS
2001
Springer
15 years 5 months ago
2001
Springer
Network programming is notoriously hard to understand: one has to deal with a variety of protocols (IP, ICMP, UDP, TCP etc), concurrency, packet loss, host failure, timeouts, the c...
101
click to vote
ATS
2000
IEEE
15 years 5 months ago
2000
IEEE
At very high frequencies, the major potential of asynchronous circuits is absence of clock skew and, through that, better exploitation of relative timing relations. This paper pre...
122
Voted
CVPR
2000
IEEE
15 years 5 months ago
2000
IEEE
We formulate face alignment as a model-based parameter estimation problem in this paper. First, we work within a framework that combines two separate subspace models to r epresent...