593 search results - page 35 / 119 » An approach to benchmarking configuration complexity |
ICRA
2008
IEEE
15 years 4 months ago
2008
IEEE
— We present an optimization-based approach to grasping and path planning for mobile manipulators. We focus on pick-and-place operations, where a given object must be moved from ...
PLDI
2010
ACM
15 years 2 months ago
2010
ACM
Traditional data-oriented programming languages such as dataflow s and stream languages provide a natural abstraction for parallel programming. In these languages, a developer fo...
108
click to vote
HEURISTICS
2010
14 years 7 months ago
2010
The urban transit routing problem (UTRP) is NP-Hard and involves devising routes for public transport systems. It is a highly complex multiply constrained problem and the evaluati...
FORTE
2008
14 years 11 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
CMG
2004
14 years 11 months ago
2004
The workload of a network is usually a heterogeneous aggregate of services and applications, driven by a large number of users. This complexity makes it challenging to evaluate th...