Sciweavers

3123 search results - page 466 / 625
» Focusing on pattern matching
Sort
View
134
Voted
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 4 months ago
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
Paul Tarau
EOR
2008
95views more  EOR 2008»
15 years 4 months ago
Enabling e-transactions with multi-attribute preference models
This paper describes potential applications of multi-attribute preference models (MAPM) in e-commerce and offers some guidelines for their implementation. MAPM are methodologies f...
John C. Butler, James S. Dyer, Jianmin Jia, Kerem ...
BMCBI
2006
141views more  BMCBI 2006»
15 years 4 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
CORR
2006
Springer
85views Education» more  CORR 2006»
15 years 4 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
DISOPT
2006
155views more  DISOPT 2006»
15 years 4 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin