Sciweavers

438 search results - page 65 / 88
» A (1-1 e)-approximation algorithm for the generalized assign...
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
13 years 7 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
ACAL
2007
Springer
14 years 2 months ago
An Integrated QAP-Based Approach to Visualize Patterns of Gene Expression Similarity
Abstract. This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model that helps to produce a visualization of microarray data, based on the r...
Mario Inostroza-Ponta, Alexandre Mendes, Regina Be...
JCSS
2007
63views more  JCSS 2007»
13 years 7 months ago
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
Rodolfo Pellizzoni, Giuseppe Lipari
WSNA
2003
ACM
14 years 1 months ago
Role-based hierarchical self organization for wireless ad hoc sensor networks
Efficiently self organizing a network hierarchy with specific assignment of roles (or tasks) to sensors based on their physical wireless connectivity and sensing characteristics ...
Manish Kochhal, Loren Schwiebert, Sandeep K. S. Gu...
WADS
2001
Springer
63views Algorithms» more  WADS 2001»
14 years 6 days ago
When Can You Fold a Map?
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
Esther M. Arkin, Michael A. Bender, Erik D. Demain...