Sciweavers

1359 search results - page 173 / 272
» Black-Box Program Specialization
Sort
View
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
14 years 3 days ago
Scheduling with integer time budgeting for low-power optimization
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
Wei Jiang, Zhiru Zhang, Miodrag Potkonjak, Jason C...
ICALP
2010
Springer
14 years 2 days ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier
DFKI
2005
Springer
14 years 1 days ago
Multiagent Systems Without Agents - Mirror-Holons for the Compilation and Enactment of Communication Structures
It is widely accepted in Distributed Artificial Intelligence that a crucial property of artificial agents is their autonomy. Whereas agent autonomy enables features of agent-base...
Matthias Nickles, Gerhard Weiß
ATMOS
2007
152views Optimization» more  ATMOS 2007»
13 years 11 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth
IPCO
2010
231views Optimization» more  IPCO 2010»
13 years 11 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos