Sciweavers

1516 search results - page 11 / 304
» The Increasing Nvalue Constraint
Sort
View
CP
2005
Springer
15 years 3 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
Grégoire Dooms, Yves Deville, Pierre Dupont
CMPB
2010
171views more  CMPB 2010»
14 years 4 months ago
Metabolica: A statistical research tool for analyzing metabolic networks
Steady state flux balance analysis (FBA) for cellular metabolism is used, e.g., to seek information on the activity of the different pathways under equilibrium conditions, or as a...
Jenni Heino, Daniela Calvetti, Erkki Somersalo
TSE
2010
155views more  TSE 2010»
14 years 4 months ago
Incremental Test Generation for Software Product Lines
Recent advances in mechanical techniques for systematic testing have increased our ability to automatically find subtle bugs, and hence to deploy more dependable software. This pap...
Engin Uzuncaova, Sarfraz Khurshid, Don S. Batory
92
Voted
INFOCOM
2012
IEEE
13 years 2 days ago
Cherish every joule: Maximizing throughput with an eye on network-wide energy consumption
—Conserving network-wide energy consumption is becoming an increasingly important concern for network operators. In this work, we study network-wide energy conservation problem w...
Canming Jiang, Yi Shi, Y. Thomas Hou, Wenjing Lou
ECCV
1996
Springer
15 years 11 months ago
Imposing Hard Constraints on Soft Snakes
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
Pascal Fua, Christian Brechbühler