Sciweavers

4378 search results - page 318 / 876
» On the Complexity of Ordered Colourings
Sort
View
LPAR
2001
Springer
15 years 11 months ago
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
Volker Diekert, Paul Gastin
IPPS
2000
IEEE
15 years 11 months ago
Parallel Computation for Chromosome Reconstruction on a Cluster of Workstations
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is...
Suchendra M. Bhandarkar, Salem Machaka, Sanjay She...
ISORC
2000
IEEE
15 years 11 months ago
An Open QoS Architecture for CORBA Applications
Distributed application programmers rely on middleware such as CORBA in order to handle the complexity that arises from the distributed and heterogeneous nature of the underlying ...
Frank Siqueira, Vinny Cahill
APSEC
1999
IEEE
15 years 11 months ago
Enhancing Object-Based System Composition through Per-Object Mixins
The management of complexity in large systems is traditionally focused on the modeling and management of classes and hierarchies of classes. In order to improve the compositional ...
Gustaf Neumann, Uwe Zdun
ASPDAC
1999
ACM
93views Hardware» more  ASPDAC 1999»
15 years 11 months ago
Optimization of Linear Placements for Wirelength Minimization with Free Sites
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky