Sciweavers

2370 search results - page 229 / 474
» A Structured Set of Higher-Order Problems
Sort
View
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
15 years 5 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
118
Voted
ANOR
2010
102views more  ANOR 2010»
15 years 4 months ago
Ejection chain and filter-and-fan methods in combinatorial optimization
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
César Rego, Fred Glover
CGF
2008
148views more  CGF 2008»
15 years 4 months ago
Automatic Registration for Articulated Shapes
We present an unsupervised algorithm for aligning a pair of shapes in the presence of significant articulated motion and missing data, while assuming no knowledge of a template, u...
Will Chang, Matthias Zwicker
IDEAL
2010
Springer
15 years 2 months ago
Applying Clustering Techniques to Reduce Complexity in Automated Planning Domains
Automated Planning is a very active area of research within Artificial Intelligence. Broadly this discipline deals with the methods by which an agent can independently determine t...
Luke Dicken, John Levine
151
Voted
PVLDB
2010
200views more  PVLDB 2010»
15 years 2 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin