Sciweavers

4451 search results - page 869 / 891
» On Random Ordering Constraints
Sort
View
ICLP
1997
Springer
14 years 15 hour ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
SIGMOD
1996
ACM
151views Database» more  SIGMOD 1996»
14 years 10 hour ago
BIRCH: An Efficient Data Clustering Method for Very Large Databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
Tian Zhang, Raghu Ramakrishnan, Miron Livny
WG
1994
Springer
13 years 12 months ago
Fugitive-Search Games on Graphs and Related Parameters
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...
ASPDAC
2007
ACM
120views Hardware» more  ASPDAC 2007»
13 years 12 months ago
Integrating Power Management into Distributed Real-time Systems at Very Low Implementation Cost
The development cost of low-power embedded systems can be significantly reduced by reusing legacy designs and applying proper modifications to meet the new power constraints. The ...
Bita Gorjiara, Nader Bagherzadeh, Pai H. Chou
ECOWS
2007
Springer
13 years 11 months ago
Semantic QoS-based Web Service Discovery Algorithms
Discovery of Web Services (WSs) has gained great research attention due to proliferation of available WSs and the failure of the syntactic approach of UDDI. Semantic discovery mech...
Kyriakos Kritikos, Dimitris Plexousakis