Sciweavers

1245 search results - page 30 / 249
» Playing with Conway's problem
Sort
View
ECAI
2004
Springer
14 years 1 months ago
A General Recursive Schema for Argumentation Semantics
Abstract. In argumentation theory, Dung’s abstract framework provides a unifying view of several alternative semantics based on the notion of extension. Recently, a new semantics...
Pietro Baroni, Massimiliano Giacomin
FSTTCS
2003
Springer
14 years 25 days ago
Pushdown Games with Unboundedness and Regular Conditions
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
Alexis-Julien Bouquet, Olivier Serre, Igor Walukie...
CORR
2007
Springer
148views Education» more  CORR 2007»
13 years 7 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
IMDS
2006
389views more  IMDS 2006»
13 years 7 months ago
Success and failure of pure-play organizations: Webvan versus Peapod, a comparative analysis
Many businesses have failed in pure play markets, on-line grocery retailers or e-grocers among them. E-grocers face many problems which the traditional brick and mortar grocery st...
Stephen E. Lunce, Leslie M. Lunce, Yoko Kawai, Bal...
CDC
2010
IEEE
101views Control Systems» more  CDC 2010»
13 years 2 months ago
Maintaining connectivity among multiple agents in cyclic pursuit: A geometric approach
This paper studies the connectivity maintenance problem in linear and nonlinear cyclic pursuit, when different control gains are assigned to each agent. Feasibility/infeasibility c...
Fabio Morbidi, Antonio Giannitrapani, Domenico Pra...