Sciweavers

1254 search results - page 72 / 251
» Making Hard Problems Harder
Sort
View
IAT
2007
IEEE
14 years 3 months ago
Privacy Loss in Classical Multiagent Planning
Privacy is often cited as the main reason to adopt a multiagent approach for a certain problem. This also holds true for multiagent planning. Still, papers on multiagent planning ...
Roman van der Krogt
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 3 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
VLDB
2007
ACM
112views Database» more  VLDB 2007»
14 years 3 months ago
A Generic solution for Warehousing Business Process Data
Improving business processes is critical to any corporation. Process improvement requires analysis as its first basic step. Process analysis has many unique challenges: i) compani...
Fabio Casati, Malú Castellanos, Umeshwar Da...
LPAR
2005
Springer
14 years 2 months ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang
ECCV
2010
Springer
14 years 2 months ago
A Stochastic Graph Evolution Framework for Robust Multi-Target Tracking
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...