Sciweavers

1095 search results - page 43 / 219
» Preprocessing of Intractable Problems
Sort
View
COMPGEOM
2001
ACM
15 years 1 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
ASPDAC
1998
ACM
119views Hardware» more  ASPDAC 1998»
15 years 2 months ago
Integer Programming Models for Optimization Problems in Test Generation
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
João P. Marques Silva
TSC
2010
159views more  TSC 2010»
14 years 4 months ago
A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple v...
Benjamin Speitkamp, Martin Bichler
EPIA
1995
Springer
15 years 1 months ago
The Retrieval Problem in a Concept Language with Number Restrictions
In this paper, we study the retrieval problem in ALN, which is a tractable concept language with number restrictions. Following the approach proposed in [12], this work differs fr...
Aida Vitória, Margarida Mamede, Luís...
AAAI
2008
15 years 4 days ago
Hypothesis Pruning and Ranking for Large Plan Recognition Problems
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
Gita Sukthankar, Katia P. Sycara