Sciweavers

710 search results - page 71 / 142
» On Minimum Power Connectivity Problems
Sort
View
ICCAD
1998
IEEE
168views Hardware» more  ICCAD 1998»
13 years 12 months ago
On-line scheduling of hard real-time tasks on variable voltage processor
We consider the problem of scheduling the mixed workload of both sporadic (on-line) and periodic (off-line) tasks on variable voltage processor to optimize power consumption while...
Inki Hong, Miodrag Potkonjak, Mani B. Srivastava
STOC
1997
ACM
76views Algorithms» more  STOC 1997»
13 years 12 months ago
Exploring Unknown Environments
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
Susanne Albers, Monika Rauch Henzinger
AAAI
2008
13 years 10 months ago
Interaction Structure and Dimensionality Reduction in Decentralized MDPs
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
Martin Allen, Marek Petrik, Shlomo Zilberstein
NOSSDAV
2005
Springer
14 years 1 months ago
Meeting CPU constraints by delaying playout of multimedia tasks
Multimedia applications today constitute a significant fraction of the workload running on portable devices such as mobile phones, PDAs and MP3 players. However, the processors i...
Balaji Raman, Samarjit Chakraborty, Wei Tsang Ooi
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky