Sciweavers

1529 search results - page 216 / 306
» On Timing Analysis of Combinational Circuits
Sort
View
ICIW
2007
IEEE
14 years 2 months ago
Towards Semantically-Enhanced Distributed Service Discovery
—In this paper, we present a new approach for service discovery combining semantic web and peer-to-peer techniques. A reference ontology is used to describe and discover services...
Raphael Romeikat, Bernhard Bauer
MSR
2006
ACM
14 years 2 months ago
Mining eclipse for cross-cutting concerns
Software may contain functionality that does not align with its architecture. Such cross-cutting concerns do not exist from the beginning but emerge over time. By analysing where ...
Silvia Breu, Thomas Zimmermann, Christian Lindig
MLDM
2005
Springer
14 years 1 months ago
Clustering Large Dynamic Datasets Using Exemplar Points
In this paper we present a method to cluster large datasets that change over time using incremental learning techniques. The approach is based on the dynamic representation of clus...
William Sia, Mihai M. Lazarescu
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
14 years 1 months ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee
ESA
2006
Springer
113views Algorithms» more  ESA 2006»
13 years 11 months ago
An LP-Designed Algorithm for Constraint Satisfaction
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
Alexander D. Scott, Gregory B. Sorkin