Sciweavers

130 search results - page 7 / 26
» Decidability Problems of a Basic Class of Object Nets
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
EOR
2010
92views more  EOR 2010»
13 years 7 months ago
A survey of variants and extensions of the resource-constrained project scheduling problem
The resource-constrained project scheduling problem (RCPSP) consists of activities that must be scheduled subject to precedence and resource constraints such that the makespan is ...
Sönke Hartmann, Dirk Briskorn
ETS
2000
IEEE
113views Hardware» more  ETS 2000»
13 years 7 months ago
NetChat: Communication and Collaboration via WWW
Practice has shown that providing content to students alone is not sufficient for good learning results. In computer based training (CBT) and especially webbased training (WBT) en...
Reinhard Kreutz, Sven Kiesow, Klaus Spitzer
EDUTAINMENT
2006
Springer
13 years 11 months ago
Computer-Assisted Teaching in Class Situation: A High-School Math Lab on Vectors
This paper presents our design and experiment of a computer-assisted class laboratory on vectors in high-school. Our main goal is to improve the acquisition on notions by all pupi...
Maud Marchal, Peggy Provent, Frederic Ruyer, Pirou...
ICCAD
2009
IEEE
98views Hardware» more  ICCAD 2009»
13 years 5 months ago
A rigorous framework for convergent net weighting schemes in timing-driven placement
We present a rigorous framework that defines a class of net weighting schemes in which unconstrained minimization is successively performed on a weighted objective. We show that, ...
Tony F. Chan, Jason Cong, Eric Radke