8917 search results - page 279 / 1784 » Abstraction in Algorithm Animation |
109
Voted
SAT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
115
Voted
CPAIOR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
119
Voted
EURONGI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
125
Voted
EUROPAR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
138
Voted
CPAIOR
2004
Springer
15 years 9 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 ...