Sciweavers

10870 search results - page 2045 / 2174
» Model Checking Programs
Sort
View
COR
2010
164views more  COR 2010»
15 years 1 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
COMGEO
2008
ACM
15 years 1 months ago
Recursive geometry of the flow complex and topology of the flow complex filtration
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
Kevin Buchin, Tamal K. Dey, Joachim Giesen, Matthi...
COMPUTER
2008
66views more  COMPUTER 2008»
15 years 1 months ago
Into the Wild: Low-Cost Ubicomp Prototype Testing
ions and techniques such as activity models, storyboards, and programming by demonstration (Y. Li and J. Landay, "Activity-Based Prototyping of Ubicomp Applications for Long-L...
Yang Li, James A. Landay
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
15 years 1 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 1 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
« Prev « First page 2045 / 2174 Last » Next »