Sciweavers

5473 search results - page 817 / 1095
» On the graph isomorphism problem
Sort
View
FLAIRS
2003
15 years 8 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 6 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
IJBRA
2008
66views more  IJBRA 2008»
15 years 6 months ago
Integer programming-based approach to allocation of reporter genes for cell array analysis
Abstract Observing behaviors of protein pathways and genetic networks under various environments in living cells is essential for unraveling disease and developing drugs. For that ...
Morihiro Hayashida, Fuyan Sun, Sachiyo Aburatani, ...
FTTCS
2006
132views more  FTTCS 2006»
15 years 6 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
15 years 6 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie