607 search results - page 52 / 122 » Unifying Exact Completions |
95
Voted
WEBI
2004
Springer
15 years 6 months ago
2004
Springer
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
116
Voted
ICWS
2004
IEEE
15 years 2 months ago
2004
IEEE
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
113
click to vote
UAI
2001
15 years 2 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
96
Voted
CORR
2008
Springer
15 years 20 days ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
ALMOB
2006
15 years 20 days ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...