Sciweavers

297 search results - page 30 / 60
» Descending Deviation Optimization techniques for scheduling ...
Sort
View
CODES
2003
IEEE
14 years 25 days ago
Design optimization of mixed time/event-triggered distributed embedded systems
Distributed embedded systems implemented with mixed, eventtriggered and time-triggered task sets, which communicate over bus protocols consisting of both static and dynamic phases...
Traian Pop, Petru Eles, Zebo Peng
CP
2011
Springer
12 years 7 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
GLOBECOM
2009
IEEE
14 years 2 months ago
Maximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Xiaohua Jia,...
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
FOCS
2000
IEEE
13 years 11 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella