4171 search results - page 790 / 835 » Choice numbers of graphs |
IJFCS
2006
14 years 11 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
107
click to vote
JACM
2006
14 years 11 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
MICRO
2008
IEEE
14 years 11 months ago
2008
IEEE
Distributed processors must balance communication and concurrency. When dividing instructions among the processors, key factors are the available concurrency, criticality of depen...
101
click to vote
ML
2006
ACM
14 years 11 months ago
2006
ACM
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
JDA
2007
14 years 11 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...