Sciweavers

386 search results - page 30 / 78
» Fundamental Questions
Sort
View
ICALP
2009
Springer
14 years 10 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
SAC
2009
ACM
14 years 4 months ago
Optimal service level allocation in environmentally powered embedded systems
Energy management is a critical concern in the design of embedded systems to prolong the lifetime or to maximize the performance under energy constraints. In particular, the emerg...
Clemens Moser, Jian-Jia Chen, Lothar Thiele
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 4 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
ICRA
2008
IEEE
136views Robotics» more  ICRA 2008»
14 years 4 months ago
Generalizing the dubins and reeds-shepp cars: Fastest paths for bounded-velocity mobile robots
— What is the shortest or fastest path a mobile robot can follow between two configurations in the unobstructed plane? The answer to this fundamental question is only known anal...
Andrei A. Furtuna, Devin J. Balkcom, Hamid Reza Ch...
BROADNETS
2007
IEEE
14 years 4 months ago
Design and control of optical grid networks
—Grid computing aims to realize a high-performance computing environment, while increasing the usage efficiency of installed resources. This puts considerable constraints on the...
Marc De Leenheer, Chris Develder, Tim Stevens, Bar...