Sciweavers

944 search results - page 31 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
IJCBDD
2008
113views more  IJCBDD 2008»
14 years 10 months ago
Parsimony accelerated Maximum Likelihood searches
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...
Kenneth Sundberg, Timothy O'Connor, Hyrum Carroll,...
AIMSA
2004
Springer
15 years 3 months ago
Exploiting the Constrainedness in Constraint Satisfaction Problems
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
Miguel A. Salido, Federico Barber
CP
2007
Springer
15 years 4 months ago
Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
Miquel Ramírez, Hector Geffner
SSDBM
2007
IEEE
172views Database» more  SSDBM 2007»
15 years 4 months ago
Enabling Real-Time Querying of Live and Historical Stream Data
Applications that query data streams in order to identify trends, patterns, or anomalies can often benefit from comparing the live stream data with archived historical stream dat...
Frederick Reiss, Kurt Stockinger, Kesheng Wu, Arie...
ISCAPDCS
2004
14 years 11 months ago
Heuristics-Based Replication Schemas for Fast Information Retrieval over the Internet
Internet today, has transformed into a global information hub. The increase in its usage and magnitude have sparkled various research problems. Because of the diverse user populat...
Samee Ullah Khan, Ishfaq Ahmad