1449 search results - page 219 / 290 » Self-Randomized Exponentiation Algorithms |
155
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
136
click to vote
WIA
2004
Springer
15 years 11 months ago
2004
Springer
Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
160
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
An incremental simulation-based approach to fault diagnosis and logic debugging is presented. During each iteration of the algorithm, a single suspicious location is identified a...
143
click to vote
INFOCOM
2002
IEEE
2002
IEEE
Routing and Wavelength Assignment in WDM Rings with Heterogeneous Wavelength Conversion Capabilities
15 years 11 months ago
—In this paper, we study the routing and wavelength assignment (RWA) tasks in WDM rings with heterogeneous wavelength conversion capabilities. By heterogeneous, we mean that diff...
191
click to vote
ASP
2001
Springer
15 years 10 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...