Sciweavers

433 search results - page 63 / 87
» A history of the history of programming languages
Sort
View
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 11 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
CDES
2006
184views Hardware» more  CDES 2006»
15 years 7 months ago
Compilation for Future Nanocomputer Architectures
Compilation has a long history of translating a programmer's human-readable code into machine instructions designed to make good use of a specific target computer. In this pa...
Thomas P. Way
AAAI
1996
15 years 7 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
SIGSOFT
2001
ACM
16 years 6 months ago
Combining UML and formal notations for modelling real-time systems
This article explores a dual approach to real-time software development. Models are written in UML, as this is expected to be relatively easy and economic. Then models are automat...
Luigi Lavazza, Gabriele Quaroni, Matteo Venturelli
131
Voted
WWW
2009
ACM
16 years 6 months ago
Rethinking email message and people search
We show how a number of novel email search features can be implemented without any kind of natural language processing (NLP) or advanced data mining. Our approach inspects the ema...
Sebastian Michel, Ingmar Weber