Sciweavers

1972 search results - page 19 / 395
» connection 2008
Sort
View
SOFTWARE
2008
13 years 5 months ago
Connecting Design with Code
Rebecca Wirfs-Brock
CN
2002
89views more  CN 2002»
13 years 7 months ago
A compound model for TCP connection arrivals for LAN and WAN applications
We propose a two level model for TCP connection arrivals in local area networks (LAN). The
Carl Nuzman, Iraj Saniee, Wim Sweldens, Alan Weiss
IPL
2008
109views more  IPL 2008»
13 years 7 months ago
Description and analysis of a bottom-up DFA minimization algorithm
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
Jorge Almeida, Marc Zeitoun
IANDC
2008
85views more  IANDC 2008»
13 years 7 months ago
Monotony properties of connected visible graph searching
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to
Pierre Fraigniaud, Nicolas Nisse