Sciweavers

3299 search results - page 535 / 660
» A general mathematics of names
Sort
View
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
15 years 12 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
MMMACNS
2005
Springer
15 years 12 months ago
Models and Analysis of Active Worm Defense
Abstract. The recent proliferation of Internet worms has raised questions about defensive measures. To date most techniques proposed are passive, in-so-far as they attempt to block...
David M. Nicol, Michael Liljenstam
CASES
2004
ACM
15 years 11 months ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
IMC
2004
ACM
15 years 11 months ago
A pragmatic approach to dealing with high-variability in network measurements
The Internet is teeming with high variability phenomena, from measured IP flow sizes to aspects of inferred router-level connectivity, but there still exists considerable debate ...
Walter Willinger, David Alderson, Lun Li
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 11 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen