Sciweavers

2200 search results - page 364 / 440
» Programming norm change
Sort
View
CIDR
2009
98views Algorithms» more  CIDR 2009»
13 years 9 months ago
From Declarative Languages to Declarative Processing in Computer Games
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
Ben Sowell, Alan J. Demers, Johannes Gehrke, Nitin...
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
13 years 9 months ago
Multiobjective robustness for portfolio optimization in volatile environments
Multiobjective methods are ideal for evolving a set of portfolio optimisation solutions that span a range from highreturn/high-risk to low-return/low-risk, and an investor can cho...
Ghada Hassan, Christopher D. Clack
FCCM
2008
IEEE
176views VLSI» more  FCCM 2008»
13 years 8 months ago
The Effectiveness of Configuration Merging in Point-to-Point Networks for Module-based FPGA Reconfiguration
Communications infrastructure for modular reconfiguration of FPGAs needs to support the changing communications interfaces of a sequence of modules. In order to avoid the overhead...
Shannon Koh, Oliver Diessel
BMCBI
2008
163views more  BMCBI 2008»
13 years 8 months ago
ProfileGrids as a new visual representation of large multiple sequence alignments: a case study of the RecA protein family
Background: Multiple sequence alignments are a fundamental tool for the comparative analysis of proteins and nucleic acids. However, large data sets are no longer manageable for v...
Alberto I. Roca, Albert E. Almada, Aaron C. Abajia...
CORR
2006
Springer
85views Education» more  CORR 2006»
13 years 8 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil