Sciweavers

2152 search results - page 229 / 431
» A Comparative Study of 2QBF Algorithms
Sort
View
IANDC
2008
92views more  IANDC 2008»
15 years 6 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
ICFEM
2009
Springer
15 years 3 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
GLOBECOM
2006
IEEE
16 years 5 days ago
Toposemantic Network Clustering
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
Leonid B. Poutievski, Kenneth L. Calvert, Jim Grif...
192
Voted
RECOMB
2006
Springer
16 years 6 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
NCA
2005
IEEE
15 years 11 months ago
Using Residual Times to Meet Deadlines in M/G/C Queues
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
Sarah Tasneem, Lester Lipsky, Reda A. Ammar, Howar...