Sciweavers

14386 search results - page 2793 / 2878
» The Chinese Generals Problem
Sort
View
AAI
2007
132views more  AAI 2007»
13 years 8 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
AI
2007
Springer
13 years 8 months ago
On the merging of Dung's argumentation systems
In this paper, the problem of deriving sensible information from a collection of argumentation systems coming from different agents is addressed. The underlying argumentation the...
Sylvie Coste-Marquis, Caroline Devred, Séba...
ALGORITHMICA
2010
153views more  ALGORITHMICA 2010»
13 years 8 months ago
Confluently Persistent Tries for Efficient Version Control
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
Erik D. Demaine, Stefan Langerman, Eric Price
ALMOB
2008
112views more  ALMOB 2008»
13 years 8 months ago
Metabolite-based clustering and visualization of mass spectrometry data using one-dimensional self-organizing maps
Background: One of the goals of global metabolomic analysis is to identify metabolic markers that are hidden within a large background of data originating from high-throughput ana...
Peter Meinicke, Thomas Lingner, Alexander Kaever, ...
AMAI
2008
Springer
13 years 8 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka
« Prev « First page 2793 / 2878 Last » Next »