Sciweavers

2477 search results - page 112 / 496
» Approximate extended formulations
Sort
View
JCAM
2011
91views more  JCAM 2011»
14 years 7 months ago
Numerical solution of linear Volterra integral equations of the second kind with sharp gradients
Collocation methods are a well developed approach for the numerical solution of smooth and weakly-singular Volterra integral equations. In this paper we extend these methods, thro...
Samuel A. Isaacson, Robert M. Kirby
ICML
2000
IEEE
16 years 4 months ago
Duality and Geometry in SVM Classifiers
We develop an intuitive geometric interpretation of the standard support vector machine (SVM) for classification of both linearly separable and inseparable data and provide a rigo...
Kristin P. Bennett, Erin J. Bredensteiner
IPSN
2004
Springer
15 years 9 months ago
An energy-aware data-centric generic utility based approach in wireless sensor networks
Distinct from wireless ad hoc networks, wireless sensor networks are data-centric, application-oriented, collaborative, and energyconstrained in nature. In this paper, formulate t...
Wei-Peng Chen, Lui Sha
VLSID
1999
IEEE
100views VLSI» more  VLSID 1999»
15 years 8 months ago
Satisfiability-Based Detailed FPGA Routing
In this paper we address the problem of detailed FPGA routing using Boolean formulation methods. In the context of FPGA routing where routing resources are fixed, Boolean formulat...
Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar
AIPS
2000
15 years 5 months ago
Planning with Incomplete Information as Heuristic Search in Belief Space
The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
Blai Bonet, Hector Geffner