Sciweavers

313 search results - page 50 / 63
» Computational Opinions
Sort
View
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
15 years 4 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
OOPSLA
2007
Springer
15 years 4 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
IMC
2006
ACM
15 years 4 months ago
Quantifying path exploration in the internet
A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of prot...
Ricardo V. Oliveira, Beichuan Zhang, Dan Pei, Rafi...
SIGCSE
2006
ACM
150views Education» more  SIGCSE 2006»
15 years 4 months ago
Pedagogical techniques supported by the use of student devices in teaching software engineering
This paper describes our experiences in promoting a learning environment where active student involvement and interaction, as well as openness to diversity of ideas are supported ...
Valentin Razmov, Richard J. Anderson
CIG
2005
IEEE
15 years 4 months ago
Forcing Neurocontrollers to Exploit Sensory Symmetry Through Hard-wired Modularity in the Game of Cellz
Several attempts have been made in the past to construct encoding schemes that allow modularity to emerge in evolving systems, but success is limited. We believe that in order to c...
Julian Togelius, Simon M. Lucas