Sciweavers

8132 search results - page 1396 / 1627
» Dependability, Abstraction, and Programming
Sort
View
CP
2007
Springer
16 years 21 days ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
CP
2007
Springer
16 years 21 days ago
Dynamic Management of Heuristics for Solving Structured CSPs
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
DEXA
2007
Springer
150views Database» more  DEXA 2007»
16 years 21 days ago
Sequence Alignment as a Database Technology Challenge
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
Hans Philippi
DNA
2007
Springer
107views Bioinformatics» more  DNA 2007»
16 years 21 days ago
Autonomous Programmable Nanorobotic Devices Using DNAzymes
Abstract. A major challenge in nanoscience is the design of synthetic molecular devices that run autonomously and are programmable. DNA-based synthetic molecular devices have the a...
John H. Reif, Sudheer Sahu
ECAL
2007
Springer
16 years 21 days ago
A Computational System for Investigating Chemotaxis-Based Cell Aggregation
Abstract. We have developed a software system that simulates chemotaxis-based cell aggregation in 2D. The model implemented within the system consists of such cell behaviors as che...
Manolya Eyiyurekli, Peter I. Lelkes, David E. Bree...
« Prev « First page 1396 / 1627 Last » Next »