Sciweavers

5331 search results - page 128 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ICCSA
2004
Springer
15 years 3 months ago
Semantic Completeness in Sub-ontology Extraction Using Distributed Methods
The use of ontologies lies at the very heart of the newly emerging era of Semantic Web. They provide a shared conceptualization of some domain that may be communicated between peop...
Mehul Bhatt, Carlo Wouters, Andrew Flahive, J. Wen...
WSC
2004
14 years 11 months ago
Simulation Optimization Using Balanced Explorative and Exploitative Search
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...
Andrei A. Prudius, Sigrún Andradótti...
TIT
2010
136views Education» more  TIT 2010»
14 years 4 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
ECCV
2008
Springer
15 years 12 months ago
Automatic Generator of Minimal Problem Solvers
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
Martin Bujnak, Tomás Pajdla, Zuzana Kukelov...
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
15 years 2 months ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh