1772 search results - page 284 / 355 » Classifying Problems into Complexity Classes |
103
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
In today’s large and complex network scenario vulnerability scanners play a major role from security perspective by proactively identifying the known security problems or vulner...
110
Voted
MFCS
2010
Springer
14 years 11 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
115
Voted
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
114
click to vote
PODS
2007
ACM
16 years 20 days ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
109
Voted
DCC
2002
IEEE
16 years 4 days ago
2002
IEEE
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...