13306 search results - page 384 / 2662 » Theoretical Computer Science |
168
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
174
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
176
click to vote
EXPCS
2007
15 years 10 months ago
2007
In this paper, we introduce EXACT, the EXperimental Algorithmics Computational Toolkit. EXACT is a software framework for describing, controlling, and analyzing computer experimen...
129
click to vote
CAD
2004
Springer
15 years 6 months ago
2004
Springer
A computer modeling approach for constructing a three-dimensional microsphere-packed bone graft structure is presented. The modeling approach consists of both geometric and CAD-ba...
163
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...