8917 search results - page 1679 / 1784 » Abstraction in Algorithm Animation |
150
click to vote
CSCLP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
136
Voted
DCOSS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. It is an undeniable fact that people want information. Unfortunately, even in today's highly automated society, a lot of the information we desire is still manually ...
154
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
141
Voted
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
129
click to vote
CLIMA
2007
15 years 4 months ago
2007
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...