1421 search results - page 11 / 285 » Satisfying KBO Constraints |
ACL
2000
13 years 9 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
MOBIQUITOUS
2007
IEEE
14 years 2 months ago
2007
IEEE
An important objective of wireless sensor networks (WSNs) is to reliably sense data about the environment in which they are deployed. Reliability in WSNs has been widely studied in...
AAIM
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
TON
2002
13 years 7 months ago
2002
Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristic...