Sciweavers

40212 search results - page 7900 / 8043
» More
Sort
View
181
Voted
AML
2011
204views Mathematics» more  AML 2011»
14 years 10 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
137
Voted
ANOR
2011
101views more  ANOR 2011»
14 years 10 months ago
The case for strategic oscillation
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
Fred Glover, Jin-Kao Hao
173
Voted
AOSD
2011
ACM
14 years 10 months ago
Experiences documenting and preserving software constraints using aspects
Software systems are increasingly being built as compositions of reusable artifacts (components, frameworks, toolkits, plug-ins, APIs, etc) that have non-trivial usage constraints...
Roberto Silveira Silva Filho, François Bron...
164
Voted
AROBOTS
2011
14 years 10 months ago
Time-extended multi-robot coordination for domains with intra-path constraints
Abstract— Many applications require teams of robots to cooperatively execute complex tasks. Among these domains are those where successful coordination solutions must respect con...
Edward Gil Jones, M. Bernardine Dias, Anthony Sten...
164
Voted
AAMAS
2011
Springer
14 years 10 months ago
Using focal point learning to improve human-machine tacit coordination
We consider an automated agent that needs to coordinate with a human partner when communication between them is not possible or is undesirable (tacit coordination games). Specifi...
Inon Zuckerman, Sarit Kraus, Jeffrey S. Rosenschei...
« Prev « First page 7900 / 8043 Last » Next »