147 search results - page 11 / 30 » How an optimal observer can collapse the search space |
AI
2002
Springer
13 years 6 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
ECCV
2010
Springer
13 years 12 months ago
2010
Springer
A fundamental question for edge detection is how faint an edge can be and still be detected. In this paper we offer a formalism to study this question and subsequently introduce a...
AAAI
1998
13 years 8 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
ICIC
2009
Springer
13 years 4 months ago
2009
Springer
This paper presents an evolutionary method for identifying the gene regulatory network from the observed time series data of gene expression using a system of ordinary differential...
AI
1999
Springer
13 years 6 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...