Sciweavers

12438 search results - page 150 / 2488
» The Magic of a Number System
Sort
View
AIPS
2008
13 years 10 months ago
From One to Many: Planning for Loosely Coupled Multi-Agent Systems
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
Ronen I. Brafman, Carmel Domshlak
CONEXT
2008
ACM
13 years 10 months ago
Maintaining replicas in unstructured P2P systems
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each obje...
Christof Leng, Wesley W. Terpstra, Bettina Kemme, ...
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 8 months ago
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
Eric Berberich, Pavel Emeliyanenko, Michael Sagral...
EXPERT
2008
78views more  EXPERT 2008»
13 years 8 months ago
Odor Recognition for Intelligent Systems
An electronic nose (e-nose) is an intelligent sensing device that uses an array of gas sensors of partial and overlapping selectivity along with a pattern recognition component to...
Amy Loutfi, Silvia Coradeschi
DPD
2006
123views more  DPD 2006»
13 years 8 months ago
Reducing network traffic in unstructured P2P systems using Top-k queries
A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solu...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez