Sciweavers

413 search results - page 23 / 83
» Coding discretizations of continuous functions
Sort
View
PPPJ
2009
ACM
14 years 2 months ago
Lazy continuations for Java virtual machines
Continuations, or ’the rest of the computation’, are a concept that is most often used in the context of functional and dynamic programming languages. Implementations of such ...
Lukas Stadler, Christian Wimmer, Thomas Würth...
RTAS
1999
IEEE
13 years 12 months ago
On Quality of Service Optimization with Discrete QoS Options
We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality prefer...
Chen Lee, John P. Lehoczky, Ragunathan Rajkumar, D...
IPSN
2005
Springer
14 years 1 months ago
Sensing capacity for discrete sensor network applications
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
Yaron Rachlin, Rohit Negi, Pradeep K. Khosla
DAGM
2005
Springer
14 years 1 months ago
Regularization on Discrete Spaces
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
Dengyong Zhou, Bernhard Schölkopf
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 27 days ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker