11328 search results - page 216 / 2266 » Timed Branching Processes |
146
Voted
IBPRIA
2007
Springer
15 years 10 months ago
2007
Springer
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
125
click to vote
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
150
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
130
click to vote
ADC
2003
Springer
15 years 9 months ago
2003
Springer
Defeasible logic is a non-monotonic logic with applications in rule-based domains such as law. To ease the development and improve the accuracy of expert systems based on defeasib...
127
click to vote
POPL
1994
ACM
15 years 8 months ago
1994
ACM
Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and p...