Sciweavers

3236 search results - page 12 / 648
» Designing better phages
Sort
View
DIAGRAMS
2008
Springer
13 years 9 months ago
Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs
Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs ...
Helen C. Purchase, Amanjit Samra
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
13 years 9 months ago
When FPGAs are better at floating-point than microprocessors
It has been shown that FPGAs could outperform high-end microprocessors on floating-point computations thanks to massive parallelism. However, most previous studies re-implement in...
Florent de Dinechin, Jérémie Detrey,...
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 7 months ago
Building Better Nurse Scheduling Algorithms
The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, ...
Uwe Aickelin, Paul White
CHI
2009
ACM
14 years 2 months ago
Tracking behavior in persuasive apps: is sensor-based detection always better than user self-reporting?
This paper aims to discuss the roles for the two types of tracking user behavior. Considering these two types of tracking, sensor based recognition has a great advantage when sens...
Miyuki Shiraishi, Yasuyuki Washio, Chihiro Takayam...
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
14 years 2 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený