20807 search results - page 195 / 4162 » How to read a paper |
225
click to vote
VSTTE
2005
Springer
16 years 3 days ago
2005
Springer
In this paper, we consider the Grand Challenge under a very specific perspective: the enabling of application experts without programming knowledge to reliably model their busines...
181
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper describes a control mechanism for a future Internet. It is an economic mechanism that enables users to choose different pairs of price/QoS priority levels for network se...
164
click to vote
CIE
2010
Springer
15 years 10 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
167
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Current computational trust models are usually built either on an agent's direct experience of an interaction partner (interaction trust) or reports provided by third parties...
199
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...