Sciweavers

303 search results - page 26 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
PDPTA
2000
13 years 9 months ago
On the application of accelerating simulation methods in network analysis
When evaluating quantitative aspects of communication networks using simulation, one of the main difficulties to face is the often considerable computing power required. In some s...
José Incera, Gerardo Rubino, Nicolás...

Lecture Notes
2225views
15 years 6 months ago
Microeconomics
The main objective of the course is for students to be able to analyze problems in microeconomic theory at the beginning graduate level. Students successfully completing the course...
Arne Hallam
DGCI
2005
Springer
14 years 2 months ago
Algorithms for the Topological Watershed
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
Michel Couprie, Laurent Najman, Gilles Bertrand
ICS
2010
Tsinghua U.
14 years 5 months ago
Are Stable Instances Easy?
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
Yonatan Bilu, Nathan Linial
HICSS
2006
IEEE
117views Biometrics» more  HICSS 2006»
14 years 2 months ago
Planning for a Big Bang in a Supply Chain: Fast Hedging for Production Indicators
— We concern ourselves with the process of making optimized production planning decisions in the face of low frequency, high impact uncertainty, which takes the form of a small n...
David L. Woodruff, Stefan Voß