Sciweavers

2079 search results - page 282 / 416
» Universality of random graphs
Sort
View
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
15 years 10 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
15 years 10 months ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
ANSS
1997
IEEE
15 years 8 months ago
JSIM: A JAVA-Based Simulation and Animation Environment
In this paper, we present JSIM, a Java-based simulation and animation environment being developed at the University of Georgia. The JSIM library includes many Java classes to make...
John A. Miller, Rajesh S. Nair, Zhiwei Zhang, Hong...
EUROMICRO
1996
IEEE
15 years 8 months ago
Efficient Program Composition on Parix by the Ensemble Methodology
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
John Yiannis Cotronis
FASE
2009
Springer
15 years 8 months ago
Object Flow Definition for Refined Activity Diagrams
Activity diagrams are a well-known means to model the control flow of system behavior. Their expressiveness can be enhanced by using their object flow notation. In addition, we ref...
Stefan Jurack, Leen Lambers, Katharina Mehner, Gab...