Sciweavers

1941 search results - page 127 / 389
» On the Hardness of Approximate Reasoning
Sort
View
CADE
2005
Springer
16 years 6 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
15 years 11 months ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
FOCS
2000
IEEE
15 years 10 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg
DAC
1996
ACM
15 years 10 months ago
A Sparse Image Method for BEM Capacitance Extraction
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions. ...
Byron Krauter, Yu Xia, E. Aykut Dengi, Lawrence T....
CVPR
2005
IEEE
16 years 8 months ago
Hybrid Joint-Separable Multibody Tracking
Statistical models for tracking different moving bodies must be able to reason about occlusions in order to be effective. Representing the joint statistics across different bodies...
Oswald Lanz, Roberto Manduchi