Sciweavers

13376 search results - page 456 / 2676
» Problem Solving with
Sort
View
IJON
2000
80views more  IJON 2000»
15 years 4 months ago
Synthesis approach for bidirectional associative memories based on the perceptron training algorithm
Bidirectional associative memories are being used extensively for solving a variety of problems related to pattern recognition. In the present paper, a new synthesis approach is d...
Ismail Salih, Stanley H. Smith, Derong Liu
ICDE
2009
IEEE
130views Database» more  ICDE 2009»
16 years 6 months ago
A Latent Topic Model for Complete Entity Resolution
In bibliographies like DBLP and Citeseer, there are three kinds of entity-name problems that need to be solved. First, multiple entities share one name, which is called the name sh...
Liangcai Shu, Bo Long, Weiyi Meng
CP
2006
Springer
15 years 8 months ago
Preprocessing QBF
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
Horst Samulowitz, Jessica Davies, Fahiem Bacchus
122
Voted
INFOCOM
2005
IEEE
15 years 10 months ago
Understanding XCP: equilibrium and fairness
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...
Steven H. Low, Lachlan L. H. Andrew, Bartek P. Wyd...
CORR
2008
Springer
153views Education» more  CORR 2008»
15 years 5 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...