13306 search results - page 415 / 2662 » Theoretical Computer Science |
195
click to vote
FOCS
2003
IEEE
16 years 4 days ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
141
click to vote
FQ
2003
Springer
16 years 2 days ago
2003
Springer
We construct a tower of function fields F0 ⊂ F1 ⊂ . . . over a finite field such that every place of every Fi ramifies in the tower and lim genus(Fi)/[Fi : F0] < ∞. We...
186
click to vote
GI
2003
Springer
16 years 2 days ago
2003
Springer
: Natural Language is not appropriate for reference models because it risks being an in-complete, unstructured and inconsistent form of representation. This paper presents insights...
169
Voted
CSR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
171
click to vote
GI
2009
Springer
15 years 11 months ago
2009
Springer
: The modeling of strategies for deriving valid project plans is a core task in development process’s design. Strategies are used for planning and for the validation of concrete ...