Sciweavers

15033 search results - page 2955 / 3007
» Complexity Theory and Algorithms
Sort
View
DATE
2004
IEEE
119views Hardware» more  DATE 2004»
15 years 1 months ago
MINCE: Matching INstructions Using Combinational Equivalence for Extensible Processor
Designing custom-extensible instructions for Extensible Processors1 is a computationally complex task because of the large design space. The task of automatically matching candida...
Newton Cheung, Sri Parameswaran, Jörg Henkel,...
DSN
2004
IEEE
15 years 1 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
CMSB
2006
Springer
15 years 1 months ago
Type Inference in Systems Biology
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
François Fages, Sylvain Soliman
FOCS
2004
IEEE
15 years 1 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...
GECCO
2006
Springer
213views Optimization» more  GECCO 2006»
15 years 1 months ago
Evolutionary unit testing of object-oriented software using strongly-typed genetic programming
Evolutionary algorithms have successfully been applied to software testing. Not only approaches that search for numeric test data for procedural test objects have been investigate...
Stefan Wappler, Joachim Wegener
« Prev « First page 2955 / 3007 Last » Next »