15485 search results - page 66 / 3097 » Computing Optimal Subsets |
CGI
1998
IEEE
13 years 12 months ago
1998
IEEE
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not f...
ASM
2005
ASM
14 years 1 months ago
2005
ASM
Abstract. In this paper we consider the following task: given an abstract state machine, characterize the subsets of initial values corresponding to different typical scenarios of...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
The ability to predict the quality of a software object can be viewed as a classification problem, where software metrics are the features and expert quality rankings the class lab...
JCNS
2008
13 years 7 months ago
2008
Using a realistic model of activity dependent dynamical synapse, which includes both depressing and facilitating mechanisms, we study the conditions in which a postsynaptic neuron...