Sciweavers

5381 search results - page 1001 / 1077
» Artificial neural networks
Sort
View
CP
2003
Springer
15 years 11 months ago
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
CP
2003
Springer
15 years 11 months ago
Improved Algorithms for Max-restricted Path Consistency
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
Fabrizio Grandoni, Giuseppe F. Italiano
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
EWCBR
2006
Springer
15 years 10 months ago
Fast Case Retrieval Nets for Textual Data
Case Retrieval Networks (CRNs) facilitate flexible and efficient retrieval in Case-Based Reasoning (CBR) systems. While CRNs scale up well to handle large numbers of cases in the c...
Sutanu Chakraborti, Robert Lothian, Nirmalie Wirat...
AAAI
2008
15 years 8 months ago
Lifted First-Order Belief Propagation
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
Parag Singla, Pedro Domingos
« Prev « First page 1001 / 1077 Last » Next »