405 search results - page 34 / 81 » Using critical sets to solve the maximum independent set pro... |
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...
ENTCS
2007
13 years 7 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
DEBS
2007
ACM
13 years 11 months ago
2007
ACM
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
CORR
2010
Springer
13 years 5 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 ...