2430 search results - page 476 / 486 » Computing Tutte Polynomials |
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
ECOWS
2008
Springer
13 years 9 months ago
2008
Springer
Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these a...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
SPLC
2008
13 years 9 months ago
2008
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...