Sciweavers

13987 search results - page 42 / 2798
» The Two Guards Problem
Sort
View
MST
2008
157views more  MST 2008»
13 years 11 months ago
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
Leah Epstein, Arik Ganot
CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 11 months ago
Two Representations for Iterative Non-prioritized Change
We address a general representation problem for belief change, and describe two interrelated representations for iterative nonprioritized change: a logical representation in terms...
Alexander Bochman
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
14 years 29 days ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
SECON
2010
IEEE
13 years 9 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
WOLLIC
2010
Springer
14 years 4 months ago
The Two-Variable Fragment with Counting Revisited
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...
Ian Pratt-Hartmann