2107 search results - page 200 / 422 » Computing Small Search Numbers in Linear Time |
158
click to vote
AI
1999
Springer
15 years 3 months ago
1999
Springer
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...
108
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
: The search for patterns or motifs in data represents a problem area of key interest to finance and economic researchers. In this paper we introduce the Motif Tracking Algorithm, ...
111
click to vote
JIRS
2007
15 years 3 months ago
2007
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
137
Voted
FLAIRS
2007
15 years 6 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
121
click to vote
SACRYPT
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Inthis paper we present several weaknesses in the keyscheduling algorithm of RC4, and describe their cryptanalytic signi cance. We identify a large number of weak keys, i...