Sciweavers

1664 search results - page 241 / 333
» Making a Case for Multi-Agent Systems
Sort
View
SCCC
2005
IEEE
15 years 10 months ago
Optimizing repair programs for consistent query answering
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
Mónica Caniupán Marileo, Leopoldo E....
SIGSOFT
2005
ACM
15 years 10 months ago
Reuse and variability in large software applications
Reuse has always been a major goal in software engineering, since it promises large gains in productivity, quality and time to market reduction. Practical experience has shown tha...
Jacky Estublier, Germán Vega
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 10 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
145
Voted
CF
2004
ACM
15 years 10 months ago
A framework for resource discovery in pervasive computing for mobile aware task execution
Aimed to provide computation ubiquitously, pervasive computing is perceived as a means to provide a user the transparency of anywhere, anyplace, anytime computing. Pervasive compu...
K. Kalapriya, S. K. Nandy, Deepti Srinivasan, R. U...
ECAI
2004
Springer
15 years 10 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière