Sciweavers

2613 search results - page 119 / 523
» On an Optimization Problem in Sensor Selection*
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
14 years 9 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
15 years 4 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
DAGSTUHL
2008
14 years 11 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
ISLPED
2003
ACM
96views Hardware» more  ISLPED 2003»
15 years 3 months ago
Effective graph theoretic techniques for the generalized low power binding problem
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
Azadeh Davoodi, Ankur Srivastava
COMCOM
2006
168views more  COMCOM 2006»
14 years 10 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen