Sciweavers

357 search results - page 16 / 72
» Algorithms for the coalitional manipulation problem
Sort
View
ATAL
2008
Springer
15 years 4 days ago
A tractable and expressive class of marginal contribution nets and its applications
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
15 years 1 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
CATS
2007
14 years 11 months ago
On The Complexity of Manipulating Elections
We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election’s outcome. All voting schemes are potentially manip...
Tom Coleman, Vanessa Teague
DATE
1997
IEEE
80views Hardware» more  DATE 1997»
15 years 2 months ago
Hybrid symbolic-explicit techniques for the graph coloring problem
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
Silvia Chiusano, Fulvio Corno, Paolo Prinetto, Mat...
EOR
2006
93views more  EOR 2006»
14 years 10 months ago
A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
Given a set of rectangular pieces and a container of fixed width and variable length, the two-dimensional strip packing problem (2D-SPP) consists of orthogonally placing all the p...
Andreas Bortfeldt