Sciweavers

42230 search results - page 421 / 8446
» Algorithms and Complexity Results for
Sort
View
SIGMOD
1999
ACM
136views Database» more  SIGMOD 1999»
15 years 11 months ago
Query Rewriting for Semistructured Data
We address the problem of query rewriting for TSL, a language for querying semistructured data. We develop and present an algorithm that, given a semistructured query q and a set ...
Yannis Papakonstantinou, Vasilis Vassalos
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
15 years 10 months ago
Heterogeneous cooperative coevolution: strategies of integration between GP and GA
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
Leonardo Vanneschi, Giancarlo Mauri, Andrea Valsec...
AAAI
2007
15 years 9 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
ACL
2006
15 years 8 months ago
Exact Decoding for Jointly Labeling and Chunking Sequences
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
Nobuyuki Shimizu, Andrew R. Haas
UAI
2004
15 years 8 months ago
Region-Based Incremental Pruning for POMDPs
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...
Zhengzhu Feng, Shlomo Zilberstein