Sciweavers

6368 search results - page 165 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
KI
2007
Springer
16 years 15 days ago
Training on the Job - Collecting Experience with Hierarchical Hybrid Automata
We propose a novel approach to experience collection for autonomous service robots performing complex activities. This approach enables robots to data for many learning problems at...
Alexandra Kirsch, Michael Beetz
DATE
2009
IEEE
149views Hardware» more  DATE 2009»
16 years 1 months ago
An ILP formulation for task mapping and scheduling on multi-core architectures
Multi-core architectures are increasingly being adopted in the design of emerging complex embedded systems. Key issues of designing such systems are on-chip interconnects, memory a...
Ying Yi, Wei Han, Xin Zhao, Ahmet T. Erdogan, Tugh...
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 8 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 10 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
PDCAT
2005
Springer
15 years 12 months ago
Solving Very Large Traveling Salesman Problems by SOM Parallelization on Cluster Architectures
This paper describes how to solve very large TravelingSalesman Problems heuristically by the parallelization of self-organizing maps on cluster architectures. The used way of para...
Hannes Schabauer, Erich Schikuta, Thomas Weish&aum...