Sciweavers

4004 search results - page 3 / 801
» How Many Packets Can We Encode
Sort
View
IJNM
2008
112views more  IJNM 2008»
13 years 8 months ago
How to avoid packet droppers with proactive routing protocols for ad hoc networks
Routing protocols for mobile ad hoc networks (MANETs) have been an active area of research for the last decade, with many very interesting potential as well as actual applications...
Ignacy Gawedzki, Khaldoun Al Agha
ITS
2000
Springer
159views Multimedia» more  ITS 2000»
14 years 3 days ago
Can We Learn from ITSs?
With the rise of VR, the internet, and mobile technologies and the shifts in educational focus from teaching to learning and from solitary to collaborative work, it's easy (bu...
Benedict du Boulay
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
14 years 6 days ago
How an optimal observer can collapse the search space
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...
Christophe Philemotte, Hugues Bersini
EOR
2007
108views more  EOR 2007»
13 years 8 months ago
How much information do we need?
ct 7 Modern technology is succeeding in delivering more information to people at ever faster rates. Under traditional 8 views of rational decision making where individuals should e...
Peter M. Todd
JGT
2006
40views more  JGT 2006»
13 years 8 months ago
How many graphs are unions of k-cliques?
We study the number F[n; k] of n-vertex graphs that can be written as the edgeunion of k-vertex cliques. We obtain reasonably tight estimates for F[n; k] in the cases (i) k = n-o(...
Béla Bollobás, Graham Brightwell