Sciweavers

221 search results - page 11 / 45
» Nine Ways to Find a Solution
Sort
View
NETWORKS
2002
14 years 9 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
SIGKDD
2010
126views more  SIGKDD 2010»
14 years 4 months ago
MultiClust 2010: discovering, summarizing and using multiple clusterings
Traditional clustering focuses on finding a single best clustering solution from data. However, given a single data set, one could interpret it in different ways. This is particul...
Xiaoli Z. Fern, Ian Davidson, Jennifer G. Dy
TSMC
2002
149views more  TSMC 2002»
14 years 9 months ago
A consensus model for multiperson decision making with different preference structures
In this paper, we present a consensus model for multiperson decision making (MPDM) problems with different preference structures based on two consensus criteria: 1) a consensus mea...
Enrique Herrera-Viedma, Francisco Herrera, Francis...
CORR
2002
Springer
83views Education» more  CORR 2002»
14 years 9 months ago
Optimal Ordered Problem Solver
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
Jürgen Schmidhuber
IJCAI
1989
14 years 10 months ago
Maximum Entropy in Nilsson's Probabilistic Logic
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
Thomas B. Kane