Sciweavers

3328 search results - page 44 / 666
» On Plateaued Functions and Their Constructions
Sort
View
HASKELL
2005
ACM
14 years 2 months ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...
ANSS
2003
IEEE
14 years 2 months ago
An ns-based Bluetooth Topology Construction Simulation Environment
Bluetooth is an emerging technology in wireless applications, and many related issues are yet to be explored both in academia and industry. Because of the complexity and the dynam...
Chia-Jui Hsu, Yuh-Jzer Joung
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 10 months ago
Fitness calculation approach for the switch-case construct in evolutionary testing
A well-designed fitness function is essential to the effectiveness and efficiency of evolutionary testing. Fitness function design has been researched extensively. For fitness ...
Yan Wang, Zhiwen Bai, Miao Zhang, Wen Du, Ying Qin...
ASIACRYPT
2009
Springer
14 years 3 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
FSTTCS
1993
Springer
14 years 28 days ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell