1711 search results - page 47 / 343 » Completing pseudojump operators |
TAINN
2005
Springer
14 years 1 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
WAC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. As the number of Wireless Sensor Networks (WSNs) applications is anticipated to grow substantially in coming years, new and radical strategies for effectively managing s...
CPAIOR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
ICTAC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
act Approach to Process Equivalence Bartek Klin Pawel Soboci´nski BRICS University of Aarhus, Denmark Abstract. A framework of Plotkin and Turi’s, originally aimed at providing ...