Sciweavers

3422 search results - page 491 / 685
» Random Subset Optimization
Sort
View
IJBC
2006
82views more  IJBC 2006»
15 years 3 months ago
How Crucial is Small World Connectivity for Dynamics?
We study the dynamical behaviour of the collective field of chaotic systems on small world lattices. Coupled neuronal systems as well as coupled logistic maps are investigated. We...
Prashant M. Gade, Sudeshna Sinha
COR
2007
112views more  COR 2007»
15 years 3 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
IOR
2006
93views more  IOR 2006»
15 years 3 months ago
A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...
Alberto Ceselli, Giovanni Righini
120
Voted
JGTOOLS
2008
100views more  JGTOOLS 2008»
15 years 3 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
DAM
2007
74views more  DAM 2007»
15 years 3 months ago
On the uniform edge-partition of a tree
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao ...