Sciweavers

16188 search results - page 2943 / 3238
» The Optimal PAC Algorithm
Sort
View
INFOCOM
2003
IEEE
15 years 12 months ago
Local Scheduling Policies in Networks of Packet Switches with Input Queues
— A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for Input Queued (IQ) and Combined Input Output Queue...
Marco Ajmone Marsan, Paolo Giaccone, Emilio Leonar...
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
15 years 12 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
ISSRE
2003
IEEE
15 years 12 months ago
Augmenting Simulated Annealing to Build Interaction Test Suites
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...
Myra B. Cohen, Charles J. Colbourn, Alan C. H. Lin...
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
15 years 12 months ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
15 years 12 months ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
« Prev « First page 2943 / 3238 Last » Next »