Sciweavers

1639 search results - page 112 / 328
» Anytime Heuristic Search
Sort
View
103
Voted
OOPSLA
2005
Springer
15 years 6 months ago
Inferring context-free grammars for domain-specific languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
Faizan Javed
ERCIMDL
2010
Springer
144views Education» more  ERCIMDL 2010»
15 years 1 months ago
Capacity-Constrained Query Formulation
Given a set of keyphrases, we analyze how Web queries with these phrases can be formed that, taken altogether, return a specified number of hits. The use case of this problem is a ...
Matthias Hagen, Benno Stein
PROCEDIA
2011
14 years 3 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
87
Voted
ATAL
2007
Springer
15 years 6 months ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
110
Voted
WWW
2008
ACM
16 years 1 months ago
Mining the search trails of surfing crowds: identifying relevant websites from user activity
The paper proposes identifying relevant information sources from the history of combined searching and browsing behavior of many Web users. While it has been previously shown that...
Mikhail Bilenko, Ryen W. White