3663 search results - page 332 / 733 » Problems in the ontology of computer programs |
200
click to vote
JNCA
2007
15 years 6 months ago
2007
Intelligent, server-side adaptation of multimedia resources is becoming increasingly important and challenging for two reasons. First, the market continuously brings up new mobile...
183
click to vote
CIKM
2005
Springer
16 years 9 days ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
187
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
145
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— The practical implementation of Min-Max MPC (MMMPC) controllers is limited by the computational burden required to compute the control law. This problem can be circumvented by ...
216
click to vote
WSC
2008
15 years 9 months ago
2008
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...