AIPS
2011
13 years 3 months ago
2011
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work (Hoffmann 2005), it was observed that the optimal relax...
AI
2011
Springer
13 years 3 months ago
2011
Springer
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
RTAS
2011
IEEE
13 years 3 months ago
2011
IEEE
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...
TMM
2010
13 years 6 months ago
2010
Abstract--In peer-to-peer (P2P) live streaming using unstructured mesh, packet scheduling is an important factor in overall playback delay. In this paper, we propose a scheduling a...
SIAMDM
2010
13 years 6 months ago
2010
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
IWOCA
2010
Springer
13 years 7 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
IJNSEC
2010
13 years 7 months ago
2010
In this paper we first propose two new concepts concerning the notion of key escrow schemes: provable partiality and independence. Roughly speaking, a scheme has provable partiali...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
ECCV
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...