Sciweavers

8132 search results - page 1452 / 1627
» Dependability, Abstraction, and Programming
Sort
View
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
15 years 6 months ago
Constraint models for graceful graphs
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
Barbara M. Smith, Jean-François Puget
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 6 months ago
Energy-efficient Scheduling of Delay Constrained Traffic over Fading Channels
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
Juyul Lee, Nihar Jindal
ECCC
2010
89views more  ECCC 2010»
15 years 6 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
ENTCS
2008
122views more  ENTCS 2008»
15 years 6 months ago
Concurrency in Biological Modeling: Behavior, Execution and Visualization
Modeling natural systems is a complicated task that involves the concurrent behavior of various processes, mechanisms and objects. Here, we describe an approach that we have been ...
David Harel, Yaki Setty, Sol Efroni, Naamah Swerdl...
FAC
2008
114views more  FAC 2008»
15 years 6 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe
« Prev « First page 1452 / 1627 Last » Next »