Sciweavers

4930 search results - page 759 / 986
» Learning minimal abstractions
Sort
View
FCT
2003
Springer
15 years 12 months ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
DATE
2002
IEEE
95views Hardware» more  DATE 2002»
15 years 11 months ago
A Polynomial Time Optimal Diode Insertion/Routing Algorithm for Fixing Antenna Problem
Abstract—Antenna problem is a phenomenon of plasma-induced gateoxide degradation. It directly affects manufacturability of very large scale integration (VLSI) circuits, especiall...
Li-Da Huang, Xiaoping Tang, Hua Xiang, D. F. Wong,...
ICPPW
2002
IEEE
15 years 11 months ago
Quantitative Analysis of Transmission Power Control in Wireless Ad-hoc Networks
Abstract—In this paper, we address the issue of transmission power control in wireless ad-hoc networks. In general, it is assumed that minimum transmission power achieves the opt...
Seung-Jong Park, Raghupathy Sivakumar
ECCV
2010
Springer
15 years 11 months ago
Scene carving: Scene consistent image retargeting
Abstract. Image retargeting algorithms often create visually disturbing distortion. We introduce the property of scene consistency, which is held by images which contain no object ...
CPAIOR
2010
Springer
15 years 11 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...