Sciweavers

749 search results - page 66 / 150
» Combinatory Models and Symbolic Computation
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
On the Hardness of Being Truthful
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
Christos H. Papadimitriou, Michael Schapira, Yaron...
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
13 years 10 months ago
Directed Animals and Gas Models Revisited
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
ESCIENCE
2006
IEEE
14 years 4 months ago
An Extended Extremal Optimisation Model for Parallel Architectures
: A relatively new meta-heuristic, known as extremal optimisation (EO), is based on the evolutionary science notion that poorly performing genes of an individual are replaced by ra...
Marcus Randall, Andrew Lewis
ICALP
2009
Springer
14 years 10 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
ENDM
2010
126views more  ENDM 2010»
13 years 10 months ago
A 0/1 Integer Programming Model for the Office Space Allocation Problem
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
Özgür Ülker, Dario Landa-Silva