3663 search results - page 448 / 733 » Problems in the ontology of computer programs |
155
click to vote
SC
2009
ACM
16 years 1 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
172
click to vote
ICRA
2006
IEEE
16 years 23 days ago
2006
IEEE
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
192
click to vote
HIPC
2005
Springer
16 years 7 days ago
2005
Springer
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
188
click to vote
IOR
2007
15 years 6 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
190
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...