Sciweavers

4377 search results - page 123 / 876
» Mass problems and randomness
Sort
View
COCOON
2007
Springer
16 years 19 days ago
Online Interval Scheduling: Randomized and Multiprocessor Cases
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zhen...
IPSN
2005
Springer
15 years 12 months ago
QoM and lifetime-constrained random deployment of sensor networks for minimum energy consumption
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
Morteza Maleki, Massoud Pedram
CP
1997
Springer
15 years 10 months ago
Random Constraint Satisfaction: A More Accurate Picture
In the last few years there has been a great amount of interest in Random Constraint Satisfaction Problems, both from an experimental and a theoretical point of view. Quite intrigu...
Dimitris Achlioptas, Lefteris M. Kirousis, Evangel...
STOC
2003
ACM
140views Algorithms» more  STOC 2003»
16 years 6 months ago
Approximation schemes for clustering problems
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
ASIAMS
2007
IEEE
16 years 24 days ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham