Sciweavers

2583 search results - page 157 / 517
» On the Representation of Timed Polyhedra
Sort
View
ESEC
1995
Springer
15 years 10 months ago
An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...
A. T. Chamillard
WSC
2007
15 years 8 months ago
Expecting the unexpected: representing, reasoning about, and assessing construction project contingencies
Planning, scheduling and effective management of contingencies are crucial for the successful management of construction projects. In this paper we explore a mathematical represen...
G. Ryan Anderson, Nilufer Onder, Amlan Mukherjee
CC
2008
Springer
240views System Software» more  CC 2008»
15 years 8 months ago
Hardware JIT Compilation for Off-the-Shelf Dynamically Reconfigurable FPGAs
JIT compilation is a model of execution which translates at run time critical parts of the program to a low level representation. Typically a JIT compiler produces machine code fro...
Etienne Bergeron, Marc Feeley, Jean-Pierre David
COMCOM
2010
179views more  COMCOM 2010»
15 years 6 months ago
On the statistical characterization of flows in Internet traffic with application to sampling
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as...
Yousra Chabchoub, Christine Fricker, Fabrice Guill...
COMGEO
2007
ACM
15 years 6 months ago
An intersection-sensitive algorithm for snap rounding
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
Mark de Berg, Dan Halperin, Mark H. Overmars