Sciweavers

1644 search results - page 96 / 329
» Finding Dominators in Practice
Sort
View
IJRR
2008
100views more  IJRR 2008»
13 years 8 months ago
Comparing the Power of Robots
Robots must complete their tasks in spite of unreliable actuators and limited, noisy sensing. In this paper, we consider the information requirements of such tasks. What sensing a...
Jason M. O'Kane, Steven M. LaValle
JAIR
2006
74views more  JAIR 2006»
13 years 8 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
ELECTRONICMARKETS
2007
60views more  ELECTRONICMARKETS 2007»
13 years 8 months ago
Cross-industry Preferences for Development of Mobile Payments in Switzerland
In this paper we present a study that unveils the technological and organizational preferences of various industries towards mobile payment developments in Switzerland. Despite th...
Jan Ondrus, Yves Pigneur
ORL
2008
63views more  ORL 2008»
13 years 8 months ago
The inequality-satisfiability problem
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
Dorit S. Hochbaum, Erick Moreno-Centeno
TCS
2008
13 years 8 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh