2681 search results - page 75 / 537 » Problem F |
AIPS
2004
13 years 11 months ago
2004
This paper considers the problem of generating partial order schedules (
ECCC
2011
13 years 1 months ago
2011
We study the following problem raised by von zur Gathen and Roche [GR97]: What is the minimal degree of a nonconstant polynomial f : {0, . . . , n} → {0, . . . , m}?
NOMS
2008
IEEE
14 years 4 months ago
2008
IEEE
—One of the major problems due to denial of service attacks is the identification of fault packets. To resolve this problem, several IP traceback methods have been defined. In th...
CIMAGING
2010
13 years 11 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
ASPDAC
2008
ACM
14 years 2 days ago
2008
ACM
Abstract-- Routing for high-speed boards is largely a timeconsuming manual task today. In this work we consider the ordered escape routing problem which is a key problem in boardle...