Sciweavers

2157 search results - page 165 / 432
» Binary ant algorithm
Sort
View
ISPE
2003
15 years 7 months ago
Negotiation algorithms for collaborative design settings
: Work to date on computational models of negotiation has focused almost exclusively on defining agreements consisting of one or a few independent issues. The negotiation involved ...
Mark Klein, Peyman Faratin, Hiroki Sayama, Yaneer ...
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 6 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
CSR
2011
Springer
14 years 10 months ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
15 years 6 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
ECCV
2006
Springer
16 years 8 months ago
Describing and Matching 2D Shapes by Their Points of Mutual Symmetry
A novel shape descriptor is introduced. It groups pairs of points that share a geometrical property that is based on their mutual symmetry. The descriptor is visualized as a diagon...
Arjan Kuijper, Ole Fogh Olsen