Sciweavers

2398 search results - page 179 / 480
» Constraint Programming and Graph Algorithms
Sort
View
FOCS
1991
IEEE
15 years 10 months ago
Dynamic Three-Dimensional Linear Programming
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
David Eppstein
DATE
2008
IEEE
117views Hardware» more  DATE 2008»
16 years 25 days ago
A Scalable Algorithmic Framework for Row-Based Power-Gating
Leakage power is a serious concern in nanometer CMOS technologies. In this paper we focus on leakage reduction through automatic insertion of sleep transistors for power gating in...
Ashoka Visweswara Sathanur, Antonio Pullini, Luca ...
COR
2006
95views more  COR 2006»
15 years 6 months ago
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems
In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a numbe...
Sancho Salcedo-Sanz, Yong Xu, Xin Yao
SCAM
2006
IEEE
16 years 11 days ago
Constructing Accurate Application Call Graphs For Java To Model Library Callbacks
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
Weilei Zhang, Barbara G. Ryder
CPAIOR
2007
Springer
16 years 16 days ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter