Sciweavers

2450 search results - page 155 / 490
» Time Mapping with Hypergraphs
Sort
View
GLVLSI
2002
IEEE
127views VLSI» more  GLVLSI 2002»
15 years 8 months ago
A new look at hardware maze routing
This paper describes a new design for a hardware accelerator to support grid-based Maze Routing. Based on the direct mapped approach of Breuer and Shamsa [3], this work refines th...
John A. Nestor
ICALP
1995
Springer
15 years 6 months ago
Intervalizing k-Colored Graphs
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
Hans L. Bodlaender, Babette de Fluiter
PE
2010
Springer
140views Optimization» more  PE 2010»
15 years 1 months ago
KPC-Toolbox: Best recipes for automatic trace fitting using Markovian Arrival Processes
We present the KPC-Toolbox, a library of MATLAB scripts for fitting workload traces into Markovian Arrival Processes (MAPs) in an automatic way based on the recently proposed Kro...
Giuliano Casale, Eddy Z. Zhang, Evgenia Smirni
DSN
2009
IEEE
15 years 10 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni
ATAL
2005
Springer
15 years 8 months ago
Bumping strategies for the multiagent agreement problem
We introduce the Multiagent Agreement Problem (MAP) to represent a class of multiagent scheduling problems. MAP is based on the Distributed Constraint Reasoning (DCR) paradigm and...
Pragnesh Jay Modi, Manuela M. Veloso