Sciweavers

661 search results - page 12 / 133
» Combining Information using Hard Constraints
Sort
View
BMCBI
2010
116views more  BMCBI 2010»
14 years 10 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
ECCV
1992
Springer
15 years 12 months ago
Combining Intensity and Motion for Incremental Segmentation and Tracking Over Long Image Sequences
This paper presents a method for incrementally segmenting images over time using both intensity and motion information. This is done by formulating a model of physically signi cant...
Michael J. Black
ICTAI
1999
IEEE
15 years 2 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
CC
2007
Springer
15 years 4 months ago
Correcting the Dynamic Call Graph Using Control-Flow Constraints
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
Byeongcheol Lee, Kevin Resnick, Michael D. Bond, K...
88
Voted
ICONFERENCE
2011
14 years 5 months ago
Personalized location-based services
Location-Based Services (LBS) are based on a combination of the inherent location information about specific data, and/or the location information supplied by LBS clients, reques...
Yiming Liu, Erik Wilde