2663 search results - page 231 / 533 » How to Choose a Timing Model |
142
click to vote
COLT
1995
Springer
15 years 8 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
143
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Previous studies on program comprehension were carried out largely in the context of procedural languages. Our purpose is to develop and evaluate a cognitive model of object-orient...
128
Voted
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
154
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
189
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...