Sciweavers

1793 search results - page 97 / 359
» On the Design of Codes for DNA Computing
Sort
View
PERVASIVE
2011
Springer
14 years 9 months ago
Hybrid Prototyping by Using Virtual and Miniature Simulation for Designing Spatial Interactive Information Systems
Abstract. In this paper, we introduce CityCompiler, an integrated environment for the iteration-based development of spatial interactive systems. CityCompiler visualizes interactiv...
Yasuto Nakanishi, Koji Sekiguchi, Takuro Ohmori, S...
ECOOPW
1999
Springer
15 years 10 months ago
Extending UML with Aspects: Aspect Support in the Design Phase
Aspect-Oriented Programming (AOP) has been considered ing abstraction principle to reduce the problem of code tangling and make software structure clean and configurable. This pap...
Junichi Suzuki, Yoshikazu Yamamoto
IPPS
2002
IEEE
15 years 11 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
NOSSDAV
2009
Springer
16 years 27 days ago
Random network coding on the iPhone: fact or fiction?
In multi-hop wireless networks, random network coding represents the general design principle of transmitting random linear combinations of blocks in the same “batch” to downs...
Hassan Shojania, Baochun Li
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
15 years 10 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...