3625 search results - page 605 / 725 » On choosing |
198
Voted
SOFSEM
2007
Springer
16 years 1 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
262
Voted
SSD
2007
Springer
16 years 1 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
207
Voted
TELETRAFFIC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...
203
Voted
BROADNETS
2006
IEEE
16 years 1 months ago
2006
IEEE
— Medium access control (MAC) protocols have been studied under different contexts for several years now. In all these MAC protocols, nodes make independent decisions on when to ...
201
Voted
BROADNETS
2006
IEEE
16 years 1 months ago
2006
IEEE
Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot mi...