Sciweavers

2573 search results - page 167 / 515
» Combinations of Modal Logics
Sort
View
139
Voted
CP
2004
Springer
15 years 10 months ago
Constraint-Based Combinators for Local Search
Abstract. One of the most appealing features of constraint programming is its rich constraint language for expressing combinatorial optimization problems. This paper demonstrates t...
Pascal Van Hentenryck, Laurent Michel, Liyuan Liu
130
Voted
AMAST
2006
Springer
15 years 8 months ago
Hyperfinite Approximations to Labeled Markov Transition Systems
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
Ernst-Erich Doberkat
IPL
2010
95views more  IPL 2010»
15 years 3 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...
ICCAD
2007
IEEE
113views Hardware» more  ICCAD 2007»
16 years 1 months ago
Combinational and sequential mapping with priority cuts
An algorithm for technology mapping of combinational and sequential logic networks is proposed and applied to mapping into K-input lookup-tables (K-LUTs). The new algorithm avoids...
Alan Mishchenko, Sungmin Cho, Satrajit Chatterjee,...
ESWS
2007
Springer
15 years 10 months ago
Intelligent Search in a Collection of Video Lectures
ct In recent years, the use of streamed digital video as a teaching and learning resource has become an increasingly attractive option for many educators as an innovation which exp...
Angela Fogarolli