Sciweavers

4074 search results - page 166 / 815
» Defining Computational Aesthetics
Sort
View
ENTCS
2002
76views more  ENTCS 2002»
13 years 10 months ago
Feasible functionals and intersection of ramified types
We show that the basic feasible functions of Cook and Urquhart's BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type i...
Daniel Leivant
SIAMJO
2000
88views more  SIAMJO 2000»
13 years 10 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
ITA
2002
13 years 10 months ago
On multiplicatively dependent linear numeration systems, and periodic points
Abstract. Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers and respectively, such that and are multiplicatively...
Christiane Frougny
CN
1999
91views more  CN 1999»
13 years 10 months ago
Universal Timestamp-Scheduling for real-time networks
Consider a network of computers interconnected by point-to-point communication channels. For each flow of packets through the network, the network reserves a fraction of the packe...
Jorge Arturo Cobb
NGC
2002
Springer
13 years 10 months ago
Chance Discovery and Scenario Analysis
Scenario analysis is often used to identify possible chance events. However, no formal, computational theory yet exists for scenario analysis. In this paper, we commence developme...
Peter McBurney, Simon Parsons