Sciweavers

867 search results - page 66 / 174
» The Generalized Maximum Coverage Problem
Sort
View
UAI
2008
13 years 9 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
ICCAD
1996
IEEE
114views Hardware» more  ICCAD 1996»
14 years 7 days ago
An efficient approach to simultaneous transistor and interconnect sizing
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...
Jason Cong, Lei He
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
13 years 9 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
IAT
2009
IEEE
14 years 2 months ago
Social Trust-Aware Recommendation System: A T-Index Approach
Collaborative Filtering based on similarity suffers from a variety of problems such as sparsity and scalability. In this paper, we propose an ontological model of trust between us...
Alireza Zarghami, Soude Fazeli, Nima Dokoohaki, Mi...
ICWMC
2006
IEEE
14 years 2 months ago
Mobility Models for UAV Group Reconnaissance Applications
In MANET research the mobility of the nodes is often described using standard synthetic models. Given a particular application, e.g. networks of unmanned aerial vehicles (UAVs) pe...
Erik Kuiper, Simin Nadjm-Tehrani