Sciweavers

12950 search results - page 2360 / 2590
» On Optimal Timed Strategies
Sort
View
COR
2006
94views more  COR 2006»
13 years 9 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 9 months ago
Multirobot rendezvous with visibility sensors in nonconvex environments
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing, the robots achieve rendezvous, that is, they move to a common location....
Anurag Ganguli, Jorge Cortés, Francesco Bul...
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 9 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
DAM
2006
132views more  DAM 2006»
13 years 9 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
DEBU
2006
166views more  DEBU 2006»
13 years 9 months ago
Oracle's Self-Tuning Architecture and Solutions
Performance tuning in modern database systems requires a lot of expertise, is very time consuming and often misdirected. Tuning attempts often lack a methodology that has a holist...
Benoît Dageville, Karl Dias
« Prev « First page 2360 / 2590 Last » Next »