Sciweavers

2168 search results - page 380 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
122
Voted
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
15 years 8 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
115
Voted
ATAL
2006
Springer
15 years 6 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
154
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 5 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
214
Voted
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 3 months ago
Equivalence of nested queries with mixed semantics
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
David DeHaan
247
Voted
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 2 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin