242 search results - page 1 / 49 » So how can I ask for it |
EDBT
2008
ACM
13 years 7 months ago
2008
ACM
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
ATAL
2006
Springer
13 years 9 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...
CHI
2005
ACM
14 years 5 months ago
2005
ACM
From pre-schools to high schools, at home and in museums, the educational community has embraced the use of computers as a teaching tool. Yet many institutions will simply install...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Protecting BGP routing from errors and malice is one of the next big challenges for Internet routing. Several approaches have been proposed that attempt to capture and block ro...