Sciweavers

41 search results - page 8 / 9
» Hereditary Properties of Tournaments
Sort
View
AI
2005
Springer
13 years 5 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
CSL
2010
Springer
13 years 6 months ago
Fibrational Induction Rules for Initial Algebras
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
Neil Ghani, Patricia Johann, Clément Fumex
IAT
2007
IEEE
14 years 3 days ago
Negotiation Dynamics: Analysis, Concession Tactics, and Outcomes
Given that a negotiation outcome is determined to a large extent by the successive offers exchanged by negotiating agents, it is useful to analyze dynamic patterns of the bidding,...
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...
GECCO
2003
Springer
283views Optimization» more  GECCO 2003»
13 years 11 months ago
A Game-Theoretic Memory Mechanism for Coevolution
One problem associated with coevolutionary algorithms is that of forgetting, where one or more previously acquired traits are lost only to be needed later. We introduce a new coevo...
Sevan G. Ficici, Jordan B. Pollack
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
13 years 12 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan