Sciweavers

1259 search results - page 114 / 252
» In search of the memoryless property
Sort
View
JSAT
2008
122views more  JSAT 2008»
13 years 8 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
WWW
2008
ACM
14 years 8 months ago
User oriented link function classification
Currently most link-related applications treat all links in the same web page to be identical. One link-related application usually requires one certain property of hyperlinks but...
Mingliang Zhu, Weiming Hu, Ou Wu, Xi Li, Xiaoqin Z...
CP
2004
Springer
14 years 1 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
FMICS
2006
Springer
13 years 11 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
ECCV
2002
Springer
14 years 9 months ago
A Stochastic Algorithm for 3D Scene Segmentation and Reconstruction
In this paper, we present a stochastic algorithm by effective Markov chain Monte Carlo (MCMC) for segmenting and reconstructing 3D scenes. The objective is to segment a range image...
Feng Han, Zhuowen Tu, Song Chun Zhu