Sciweavers

19700 search results - page 3700 / 3940
» DNA-Based Computation Times
Sort
View
203
Voted
HOTI
2002
IEEE
15 years 11 months ago
Stable Round-Robin Scheduling Algorithms for High-Performance Input Queued Switches
High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Que...
Jing Liu, Chun Kit Hung, Mounir Hamdi, Chi-Ying Ts...
ICDCS
2002
IEEE
15 years 11 months ago
A Practical Approach for ?Zero? Downtime in an Operational Information System
An Operational Information System (OIS) supports a real-time view of an organization’s information critical to its logistical business operations. A central component of an OIS ...
Ada Gavrilovska, Karsten Schwan, Van Oleson
IEEEPACT
2002
IEEE
15 years 11 months ago
Workload Design: Selecting Representative Program-Input Pairs
Having a representative workload of the target domain of a microprocessor is extremely important throughout its design. The composition of a workload involves two issues: (i) whic...
Lieven Eeckhout, Hans Vandierendonck, Koenraad De ...
184
Voted
ISPAN
2002
IEEE
15 years 11 months ago
Building Ontology for Optimization and Composition of Parallel JavaBean Programs
Abstract— In this paper, we propose an ontology specification for JavaBean programs, the object component model of Java. Our specification is written using the DAML+OIL languag...
Cheng-Wei Chen, Chung-Kai Chen, Jenq Kuen Lee
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 11 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
« Prev « First page 3700 / 3940 Last » Next »