Sciweavers

14298 search results - page 2502 / 2860
» Dynamic Languages and Applications
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
CCS
2007
ACM
15 years 10 months ago
Analyzing network traffic to detect self-decrypting exploit code
Remotely-launched software exploits are a common way for attackers to intrude into vulnerable computer systems. As detection techniques improve, remote exploitation techniques are...
Qinghua Zhang, Douglas S. Reeves, Peng Ning, S. Pu...
ATAL
2006
Springer
15 years 10 months ago
Convergence analysis for collective vocabulary development
We study how decentralized agents can develop a shared vocabulary without global coordination. Answering this question can help us understand the emergence of many communication s...
Jun Wang, Les Gasser, Jim Houk
CHI
1995
ACM
15 years 10 months ago
The ScienceWare Modeler: a learner-centered tool for students building models
The Modeler is designed using a learner-centered approach [5], with scaffolding to address the specific needs of learners. Scaffolding [3] is an educational term that refers to pro...
Shari L. Jackson
TAPSOFT
1995
Springer
15 years 10 months ago
Comparing Flow-Based Binding-Time Analyses
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
Jens Palsberg
« Prev « First page 2502 / 2860 Last » Next »