Sciweavers

969 search results - page 73 / 194
» Programming as Problem Solving: A Participatory Theater Appr...
Sort
View
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
15 years 1 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
147
Voted
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
15 years 7 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann
ASPLOS
2012
ACM
13 years 11 months ago
ELI: bare-metal performance for I/O virtualization
Direct device assignment enhances the performance of guest virtual machines by allowing them to communicate with I/O devices without host involvement. But even with device assignm...
Abel Gordon, Nadav Amit, Nadav Har'El, Muli Ben-Ye...
138
Voted
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 9 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
CPAIOR
2007
Springer
15 years 10 months 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