13841 search results - page 355 / 2769 » Algorithms and Constraint Programming |
181
click to vote
FLOPS
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
156
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper discusses the problem of generating patrol paths for a team of mobile robots inside a designated target area. Patrolling requires an area to be visited repeatedly by...
171
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we present an Extended Kalman Filter (EKF)-based algorithm for real-time vision-aided inertial navigation. The primary contribution of this work is the derivatio...
176
click to vote
GCC
2003
Springer
16 years 8 hour ago
2003
Springer
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
161
click to vote
EUC
2004
Springer
15 years 10 months ago
2004
Springer
In archiectural synthesis, scheduling and resource allocation are important steps. During the early stage of the design, imprecise information is unavoidable. Under the imprecise ...