Sciweavers

4074 search results - page 77 / 815
» Defining Computational Aesthetics
Sort
View
ENTCS
2002
110views more  ENTCS 2002»
13 years 8 months ago
The Solution Operator of the Korteweg-de Vries Equation is Computable
The initial value problem of the Korteweg-de Vries (KdV) equation posted on the real line R: ut + uux + uxxx = 0, x R, t R u(x, 0) = (x), defines a nonlinear map KR from the ...
Klaus Weihrauch, Ning Zhong 0002
JC
2000
89views more  JC 2000»
13 years 8 months ago
Weakly Computable Real Numbers
The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degr...
Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
CRIWG
2003
13 years 10 months ago
Improving the Use of Strategies in Computer-Supported Collaborative Processes
The members of a work group need to apply a common strategy to collaboratively solve a problem. A good strategy will mainly depend on the collaboration scenario, participants’ ba...
César A. Collazos, Luis A. Guerrero, Jos&ea...
MOR
2008
83views more  MOR 2008»
13 years 9 months ago
Extensive-Form Correlated Equilibrium: Definition and Computational Complexity
Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...
Bernhard von Stengel, Françoise Forges
SP
2002
IEEE
161views Security Privacy» more  SP 2002»
13 years 8 months ago
Improving Computer Security Using Extended Static Checking
We describe a method for finding security flaws in source code by way of static analysis. The method is notable because it allows a user to specify a wide range of security proper...
Brian Chess