Sciweavers

2841 search results - page 399 / 569
» A Call to Order
Sort
View
AI
1998
Springer
15 years 6 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
ASE
1998
152views more  ASE 1998»
15 years 6 months ago
Apel: A Graphical Yet Executable Formalism for Process Modeling
Software process improvement requires high level formalisms for describing project-specific, organizational and quality aspects. These formalisms must be convenient not only for ...
Samir Dami, Jacky Estublier, Mahfoud Amiour
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
15 years 6 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...
JACM
2002
94views more  JACM 2002»
15 years 6 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
CGF
1999
125views more  CGF 1999»
15 years 6 months ago
Partitioning and Handling Massive Models for Interactive Collision Detection
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...