16091 search results - page 281 / 3219 » Solving |
170
click to vote
TACAS
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedig...
161
click to vote
PRDC
2006
IEEE
16 years 18 days ago
2006
IEEE
The finite average response time model is a very weak distributed systems model: it permits runs with unbounded transmission and processing delays and it does not bound the relat...
157
click to vote
ACMSE
2006
ACM
16 years 17 days ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
171
click to vote
SIGCSE
2006
ACM
16 years 16 days ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
141
click to vote
INFOCOM
2005
IEEE
16 years 5 days ago
2005
IEEE
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...