Sciweavers

125 search results - page 24 / 25
» An Efficient Heuristic Approach to Solve the Unate Covering ...
Sort
View
COMCOM
2006
121views more  COMCOM 2006»
13 years 5 months ago
Load-balanced agent activation for value-added network services
In relation to its growth in size and user population, the Internet faces new challenges that have triggered the proposals of value-added network services, e.g., IP multicast, IP ...
Chao Gong, Kamil Saraç, Ovidiu Daescu, Bala...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 9 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
TSP
2008
151views more  TSP 2008»
13 years 5 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
TPDS
2008
175views more  TPDS 2008»
13 years 5 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
WACC
1999
ACM
13 years 10 months ago
Building a federation of process support systems
The effort in software process support has focused so far on modeling and enacting processes. A certain amount of work has been done, but little has reached a satisfactory level o...
Jacky Estublier, Mahfoud Amiour, Samir Dami