4074 search results - page 166 / 815 » Defining Computational Aesthetics |
83
Voted
ENTCS
2002
15 years 15 days ago
2002
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...
112
Voted
SIAMJO
2000
15 years 14 days ago
2000
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...
99
Voted
ITA
2002
15 years 11 days ago
2002
Abstract. Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers and respectively, such that and are multiplicatively...
92
Voted
CN
1999
15 years 11 days ago
1999
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...
83
Voted
NGC
2002
Springer
15 years 10 days ago
2002
Springer
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...