3471 search results - page 673 / 695 » Obstacle Numbers of Graphs |
111
Voted
ESOP
2001
Springer
15 years 8 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
129
Voted
STACS
2001
Springer
15 years 8 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
137
Voted
CIAC
2000
Springer
15 years 8 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
135
Voted
SMA
1999
ACM
15 years 7 months ago
1999
ACM
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
164
Voted
SPAA
1999
ACM
15 years 7 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...