1022 search results - page 75 / 205 » New models and algorithms for programmable networks |
191
click to vote
STOC
1993
ACM
15 years 4 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
119
click to vote
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
PADS
1999
ACM
15 years 5 months ago
1999
ACM
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general cons...
85
Voted
WISE
2005
Springer
15 years 6 months ago
2005
Springer
Building on previous work on how to model contextual information for desktop search and how to implement semantically rich information exchange in social networks, we define a new...
115
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...