Sciweavers

7289 search results - page 115 / 1458
» A Dependent Set Theory
Sort
View
AAAI
2000
13 years 9 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
CORR
2006
Springer
103views Education» more  CORR 2006»
13 years 8 months ago
Positional Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
Erich Grädel, Igor Walukiewicz
LCPC
1994
Springer
14 years 4 days ago
Minimal Data Dependence Abstractions for Loop Transformations
Data Dependence Abstractions for Loop Transformations Yi-Qing Yang Corinne Ancourt Francois Irigoin Ecole des Mines de Paris/CRI 77305 Fontainebleau Cedex France tractions of prog...
Yi-Qing Yang, Corinne Ancourt, François Iri...
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
CCCG
2007
13 years 9 months ago
Contraction and Expansion of Convex Sets
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
Michael Langberg, Leonard J. Schulman