2593 search results - page 465 / 519 » Algorithms and Data Structures for Computer Topology |
117
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
136
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
125
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
117
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
141
click to vote
ICML
2000
IEEE
16 years 3 months ago
2000
IEEE
Humanoid robots are high-dimensional movement systems for which analytical system identification and control methods are insufficient due to unknown nonlinearities in the system s...