3415 search results - page 540 / 683 » Lower Bounds for Kernelizations |
136
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
135
click to vote
IPCCC
2005
IEEE
15 years 10 months ago
2005
IEEE
Localization is a fundamental operation in mobile and self-configuring networks such as sensor networks and mobile ad hoc networks. For example, sensor location is often critical...
111
click to vote
LICS
2005
IEEE
15 years 10 months ago
2005
IEEE
We construct a domain-theoretic calculus for Lipschitz and differentiable functions, which includes addition, subtraction and composition. We then develop a domaintheoretic versio...
125
click to vote
ASPDAC
2005
ACM
15 years 10 months ago
2005
ACM
- Many high-level description languages, such as C/C++ or Java, lack the capability to specify the bitwidth information for variables and operations. Synthesis from these specifica...
186
click to vote
ISPD
2005
ACM
15 years 10 months ago
2005
ACM
In this paper we introduce the concept of zero-change transformations to quantify the suboptimality of existing placers. Given a netlist and its placement from a placer, we formal...