14739 search results - page 362 / 2948 » An optimization problem on the sphere |
148
click to vote
ICN
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. This paper considers the primary and secondary path generation problem in traffic engineering. We first present a standard MILP model. Since its size and integrality gap...
184
click to vote
SAC
2004
ACM
16 years 7 days ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
158
click to vote
EVOW
2003
Springer
16 years 1 days ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
188
click to vote
GECCO
2003
Springer
16 years 23 hour ago
2003
Springer
We present the result of our work on use of genetic programming for evolving social behavior of agents situated in inherently cooperative environment. We use predators-prey pursuit...
166
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...