Sciweavers

7773 search results - page 436 / 1555
» On generalized Frame-Stewart numbers
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 11 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
ERCIMDL
2009
Springer
177views Education» more  ERCIMDL 2009»
15 years 11 months ago
Curated Databases
Curated databases are databases that are populated and updated with a great deal of human effort. Most reference works that one traditionally found on the reference shelves of li...
Peter Buneman
COMPGEOM
2010
ACM
15 years 11 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
PODC
2010
ACM
15 years 10 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
SAS
2000
Springer
124views Formal Methods» more  SAS 2000»
15 years 10 months ago
Code Specialization Based on Value Profiles
Abstract. It is often the case at runtime that variables and registers in programs are "quasi-invariant," i.e., the distribution of the values they take on is very skewed...
Robert Muth, Scott A. Watterson, Saumya K. Debray