Sciweavers

6455 search results - page 457 / 1291
» Research problems
Sort
View
205
Voted
JCM
2007
131views more  JCM 2007»
15 years 6 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
193
Voted
GLOBECOM
2009
IEEE
15 years 10 months ago
Joint Base Station Placement and Fault-Tolerant Routing in Wireless Sensor Networks
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
Dejun Yang, Satyajayant Misra, Guoliang Xue
173
Voted
WCE
2007
15 years 8 months ago
High-Performance Multigrid Solvers in Reconfigurable Hardware
—Partial Differential Equations (PDEs) play an essential role in modeling real world problems. The broad field of modeling such systems has drawn the researchers’ attention for...
Safaa J. Kasbah, Issam W. Damaj
175
Voted
IJAMCIGI
2010
90views more  IJAMCIGI 2010»
15 years 4 months ago
A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling
Hyper-heuristics are identified as the methodologies that search the space generated by a finite set of low level heuristics for solving difficult problems. One of the iterative h...
Ender Özcan, Mustafa Misir, Gabriela Ochoa, E...
175
Voted
GROUP
2009
ACM
16 years 1 months ago
Usability heuristics for networked multiplayer games
Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between playe...
David Pinelle, Nelson Wong, Tadeusz Stach, Carl Gu...