Sciweavers

573 search results - page 107 / 115
» Diagnosis of Discrete-Event Systems Using Satisfiability Alg...
Sort
View
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
WWW
2008
ACM
14 years 8 months ago
Performance of compressed inverted list caching in search engines
Due to the rapid growth in the size of the web, web search engines are facing enormous performance challenges. The larger engines in particular have to be able to process tens of ...
Jiangong Zhang, Xiaohui Long, Torsten Suel
WWW
2010
ACM
14 years 21 days ago
Data summaries for on-demand queries over linked data
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
Andreas Harth, Katja Hose, Marcel Karnstedt, Axel ...
HPDC
2002
IEEE
14 years 10 days ago
A Scalable QoS-Aware Service Aggregation Model for Peer-to-Peer Computing Grids
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These syste...
Xiaohui Gu, Klara Nahrstedt
ICALP
2009
Springer
14 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner