Sciweavers

1292 search results - page 181 / 259
» An Experimental Evaluation of the New OpenMP Tasking Model
Sort
View
ATAL
2007
Springer
15 years 7 months ago
Unifying distributed constraint algorithms in a BDI negotiation framework
This paper presents a novel, unified distributed constraint satisfaction framework based on automated negotiation. The Distributed Constraint Satisfaction Problem (DCSP) is one t...
Bao Chau Le Dinh, Kiam Tian Seow
DSRT
2009
IEEE
15 years 4 months ago
An Approach for Parallel Interest Matching in Distributed Virtual Environments
—Interest management is essential for real-time large-scale distributed virtual environments (DVEs) which seeks to filter irrelevant messages on the network. Many existing inter...
Elvis S. Liu, Georgios K. Theodoropoulos
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 5 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
ICRA
2007
IEEE
175views Robotics» more  ICRA 2007»
15 years 7 months ago
Visual Servoing in Non-Rigid Environments: A Space-Time Approach
— Most robotic vision algorithms are proposed by envisaging robots operating in structured environments where the world is assumed to be rigid. These algorithms fail to provide o...
D. Santosh, C. V. Jawahar
CIKM
2008
Springer
15 years 3 months ago
Large-scale, parallel automatic patent annotation
When researching new product ideas or filing new patents, inventors need to retrieve all relevant pre-existing know-how and/or to exploit and enforce patents in their technologica...
Milan Agatonovic, Niraj Aswani, Kalina Bontcheva, ...