Sciweavers

2100 search results - page 196 / 420
» Fundamentals of the problem
Sort
View
104
Voted
RAS
2002
129views more  RAS 2002»
15 years 12 days ago
Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
109
Voted
TCS
1998
15 years 12 days ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...
PVLDB
2008
82views more  PVLDB 2008»
15 years 7 days ago
STBenchmark: towards a benchmark for mapping systems
A fundamental problem in information integration is to precisely specify the relationships, called mappings, between schemas. Designing mappings is a time-consuming process. To al...
Bogdan Alexe, Wang Chiew Tan, Yannis Velegrakis
ICFEM
2010
Springer
14 years 11 months ago
A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model
Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races an...
Scott West, Sebastian Nanz, Bertrand Meyer
118
Voted
IEEEHPCS
2010
14 years 11 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...