Sciweavers

434 search results - page 47 / 87
» Constraint-Based Combinators for Local Search
Sort
View
CONSTRAINTS
2011
15 years 1 days ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
INFOCOM
2005
IEEE
15 years 10 months ago
Assisted peer-to-peer search with partial indexing
—In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P app...
Rongmei Zhang, Y. Charlie Hu
CIDM
2007
IEEE
15 years 11 months ago
Distributed Document Clustering Using Word-clusters
−Document clustering has become an increasingly important task in analyzing huge numbers of documents distributed among various sites. The challenging aspect is to analyze this e...
Debzani Deb, Rafal A. Angryk
CGF
2008
103views more  CGF 2008»
15 years 5 months ago
An Example-based Procedural System for Element Arrangement
We present a method for synthesizing two dimensional (2D) element arrangements from an example. The main idea is to combine texture synthesis techniques based-on a local neighborh...
Takashi Ijiri, Radomír Mech, Takeo Igarashi...
308
Voted
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
14 years 8 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache