Sciweavers

689 search results - page 107 / 138
» The multithreaded version of FORM
Sort
View
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
CADE
1998
Springer
14 years 6 days ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
KDD
1998
ACM
141views Data Mining» more  KDD 1998»
14 years 6 days ago
Rule Discovery from Time Series
We consider the problem of nding rules relating patterns in a time series to other patterns in that series, or patterns in one series to patterns in another series. A simple examp...
Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Ren...
BMCBI
2010
90views more  BMCBI 2010»
13 years 8 months ago
Local alignment of generalized k-base encoded DNA sequence
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...
Nils Homer, Stanley F. Nelson, Barry Merriman
AI
2006
Springer
13 years 8 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm