Sciweavers

4426 search results - page 669 / 886
» Concurrent Constraint Programming
Sort
View
TCS
2008
15 years 6 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
TNN
2008
81views more  TNN 2008»
15 years 6 months ago
Nonlinear Knowledge-Based Classification
Prior knowledge over general nonlinear sets is incorporated into nonlinear kernel classification problems as linear constraints in a linear program. The key tool in this incorpora...
Olvi L. Mangasarian, Edward W. Wild
ANOR
2002
67views more  ANOR 2002»
15 years 6 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
CGF
2000
72views more  CGF 2000»
15 years 6 months ago
Priority-Driven Acoustic Modeling for Virtual Environments
Geometric acoustic modeling systems spatialize sounds according to reverberation paths from a sound source to a receiver to give an auditory impression of a virtual 3D environment...
Patrick Min, Thomas A. Funkhouser
ENTCS
2002
99views more  ENTCS 2002»
15 years 6 months ago
Greatest Bisimulations for Binary Methods
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
Hendrik Tews