Sciweavers

1433 search results - page 80 / 287
» On Covering Problems of Rado
Sort
View
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
15 years 11 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
WSNA
2003
ACM
15 years 11 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng
HICSS
2002
IEEE
172views Biometrics» more  HICSS 2002»
15 years 11 months ago
Collaborative Software Development: A Discussion of Problem Solving Models and Groupware Technologies
Teamwork is always challenging. Adding the complication of problem solving and software design only amplifies this challenge. The challenges of developing software as a team can b...
Joanna DeFranco-Tommarello, Fadi P. Deek
EOR
2010
159views more  EOR 2010»
15 years 1 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
UAI
2001
15 years 7 months ago
A Clustering Approach to Solving Large Stochastic Matching Problems
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
Milos Hauskrecht, Eli Upfal