Sciweavers

2666 search results - page 388 / 534
» Computing with Evolving Proteins
Sort
View
AAAI
1994
14 years 11 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
ANSOFT
2002
159views more  ANSOFT 2002»
14 years 10 months ago
Using Component-Based Development and Web Technologies to Support a Distributed Data Management System
Over recent years, "Internet-able" applications have been used to support domains where distributed functionality is essential. This flexibility is also pertinent in situ...
M. Brian Blake, Gail Hamilton, Jeffrey Hoyt
INTERACTIONS
2010
97views more  INTERACTIONS 2010»
14 years 8 months ago
Design challenge based learning (DCBL) and sustainable pedagogical practice
s on Human Factors in Computing Systems. CHI ‘07. New York: ACM, 2007. university environment at scale, with structure, and with rigor. The notion of studio culture and learning ...
Eli Blevis
ICS
2010
Tsinghua U.
15 years 7 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
SASP
2009
IEEE
291views Hardware» more  SASP 2009»
15 years 4 months ago
A parameterisable and scalable Smith-Waterman algorithm implementation on CUDA-compatible GPUs
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
Cheng Ling, Khaled Benkrid, Tsuyoshi Hamada