Sciweavers

116 search results - page 2 / 24
» Gaining Efficiency and Flexibility in the Simple Temporal Pr...
Sort
View
117
Voted
ATAL
2010
Springer
15 years 2 months ago
Optimal temporal decoupling in multiagent systems
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...
Léon Planken, Mathijs de Weerdt, Cees Witte...
114
Voted
CP
2005
Springer
15 years 6 months ago
Solving Simple Planning Problems with More Inference and No Search
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...
Vincent Vidal, Hector Geffner
111
Voted
CVPR
2010
IEEE
15 years 3 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
128
Voted
LISA
2004
15 years 2 months ago
Real-time Log File Analysis Using the Simple Event Correlator (SEC)
Originally published at Usenix LISA 2004 conference. November 2004 Atlanta, Georiga, USA. Log analysis is an important way to keep track of computers and networks. The use of auto...
John P. Rouillard
94
Voted
CASES
2007
ACM
15 years 5 months ago
An efficient framework for dynamic reconfiguration of instruction-set customization
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
Huynh Phung Huynh, Joon Edward Sim, Tulika Mitra