Sciweavers

957 search results - page 134 / 192
» Addition Chain Heuristics
Sort
View
80
Voted
MICAI
2005
Springer
15 years 5 months ago
EventNet: Inferring Temporal Relations Between Commonsense Events
In this paper, we describe EventNet, a toolkit for inferring temporal relations between Commonsense events. It comprises 10,000 nodes and 30,000 temporal links mined from the Openm...
José H. Espinosa, Henry Lieberman
WEBI
2005
Springer
15 years 5 months ago
Integrating Element and Term Semantics for Similarity-Based XML Document Clustering
Structured link vector model (SLVM) is a recently proposed document representation that takes into account both structural and semantic information for measuring XML document simi...
Jianwu Yang, William K. Cheung, Xiaoou Chen
WIA
2005
Springer
15 years 5 months ago
Shorter Regular Expressions from Finite-State Automata
We consider the use of state elimination to construct shorter regular expressions from finite-state automata. Although state elimination is an intuitive method for computing regul...
Yo-Sub Han, Derick Wood
CP
2004
Springer
15 years 5 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 5 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf