7504 search results - page 310 / 1501 » Computing with Action Potentials |
150
click to vote
KR
1998
Springer
15 years 8 months ago
1998
Springer
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
148
Voted
AIPS
2008
15 years 6 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
139
click to vote
GPEM
2008
15 years 4 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
177
click to vote
CORR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
131
click to vote
FDG
2009
ACM
15 years 10 months ago
2009
ACM
Hardware and platform limitations restrict the display settings for most computer games, forcing a tradeoff between frame rate and resolution to achieve acceptable performance. Pr...