Sciweavers

1957 search results - page 39 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
15 years 3 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
ICC
2007
IEEE
121views Communications» more  ICC 2007»
15 years 4 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc
HYBRID
2000
Springer
15 years 1 months ago
A Hybrid Feedback Regulator Approach to Control an Automotive Suspension System
Abstract. In this paper, we demonstrate a novel hybrid control synthesis approach using an automotive suspension system. Discrete abstractions are used to approximate the continuou...
Xenofon D. Koutsoukos, Panos J. Antsaklis
AINA
2009
IEEE
14 years 7 months ago
Approximating Travel Times Using Opportunistic Networking
Determining the time and means by which to travel from location A to location B for a person utilising a MANET requires the dissemination of both realtime and historic data. In thi...
Rudi Ball, Naranker Dulay
RCIS
2010
14 years 8 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu