4486 search results - page 240 / 898 » Adaptable Boundary Sets |
249
click to vote
TJS
2002
15 years 6 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
256
click to vote
COMPGEOM
2001
ACM
15 years 11 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
211
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
221
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possibl...
206
click to vote
ATAL
2008
Springer
15 years 9 months ago
2008
Springer
In open settings, the participants are autonomous and there is no central authority to ensure the felicity of their interactions. When agents interact in such settings, each relie...