Sciweavers

309 search results - page 26 / 62
» Termination proofs for systems code
Sort
View
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 7 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
ICC
2007
IEEE
135views Communications» more  ICC 2007»
14 years 2 months ago
Adaptive Modulation and Coding for Hybrid Cooperative Networks
— This paper deals with throughput oriented Adaptive Modulation and Coding (AMC) techniques combined with cooperative protocols where terminals are constrained by half-duplex as...
Emilio Calvanese Strinati, Sheng Yang, Jean-Claude...
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
13 years 8 months ago
On hopeful monsters, neutral networks and junk code in evolving L-systems
This paper investigates L-system evolution through experiments with a simulation platform of virtual plants. The conducted simulations vary the occurrence probability of terminal ...
Stefan Bornhofen, Claude Lattaud
BIRTHDAY
2003
Springer
13 years 11 months ago
Aspect Validation Using Model Checking
Aspects are intended to add needed functionality to a system or to treat concerns of the system by augmenting or changing the existing code in a manner that cross-cuts the usual c...
Shmuel Katz, Marcelo Sihman
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
13 years 12 months ago
Picture Programming Project
Visual Language (VL) system development is getting increasingly sophisticated in part due to the arduous nature of user interface (UI) code development. This typically involves id...
Nita Goyal, Charles Hoch, Ravi Krishnamurthy, Bria...