Sciweavers

2412 search results - page 363 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
ICDM
2005
IEEE
142views Data Mining» more  ICDM 2005»
14 years 1 months ago
Shortest-Path Kernels on Graphs
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
Karsten M. Borgwardt, Hans-Peter Kriegel
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 1 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
VRST
2004
ACM
14 years 1 months ago
FreeWalk/Q: social interaction platform in virtual space
We have integrated technologies related to virtual social interaction, e.g. virtual environments, visual simulations, and lifelike characters. In our previous efforts to integrate...
Hideyuki Nakanishi, Toru Ishida
MMAS
2004
Springer
14 years 1 months ago
Quantitative Organizational Models for Large-Scale Agent Systems
Abstract. As the scale and scope of multi-agent systems grow, it becomes increasingly important to design and manage the manner in which the participants interact. The potential fo...
Bryan Horling, Victor R. Lesser
PODS
2010
ACM
249views Database» more  PODS 2010»
14 years 27 days ago
Semantic query optimization in the presence of types
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...