Sciweavers

2485 search results - page 351 / 497
» Time Bounded Frequency Computations
Sort
View
GLOBECOM
2009
IEEE
13 years 11 months ago
Joint Base Station Placement and Fault-Tolerant Routing in Wireless Sensor Networks
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
Dejun Yang, Satyajayant Misra, Guoliang Xue
ICALP
2010
Springer
13 years 10 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
EWRL
2008
13 years 9 months ago
Optimistic Planning of Deterministic Systems
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
Jean-François Hren, Rémi Munos
APPINF
2003
13 years 9 months ago
Comparing the Optimal Performance of Multiprocessor Architectures
Consider a parallel program with n processes and a synchronization granularity z. Consider also two multiprocessors: a multiprocessor with q processors and run-time reallocation o...
Lars Lundberg, Kamilla Klonowska, Magnus Broberg, ...
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
13 years 9 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking