Sciweavers

SYNASC
2008
IEEE
274views Algorithms» more  SYNASC 2008»
14 years 6 months ago
Verbalising R2ML Rules into SBVR
Nowadays, business rules receive a lot of attention from both industry and academia, as they are considered the ideal vehicle for capturing business logic. The purpose of our pape...
Oana Nicolae, Gerd Wagner
SYNASC
2008
IEEE
277views Algorithms» more  SYNASC 2008»
14 years 6 months ago
An Adaptive Particle Swarm Optimizer Using Balanced Explorative and Exploitative Behaviors
Particle Swarm Optimization (PSO) has recently emerged as a nature inspired algorithm for real parameter optimization. This article describes a method for improving the final accur...
Sayan Ghosh, Debarati Kundu, Kaushik Suresh, Swaga...
SYNASC
2008
IEEE
300views Algorithms» more  SYNASC 2008»
14 years 6 months ago
A Theory of Adaptable Contract-Based Service Composition
Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a ...
Giovanni Bernardi, Michele Bugliesi, Damiano Maced...
SYNASC
2008
IEEE
235views Algorithms» more  SYNASC 2008»
14 years 6 months ago
Communicating Mathematics via Pen-Based Interfaces
Elena S. Smirnova, Stephen M. Watt
SYNASC
2008
IEEE
239views Algorithms» more  SYNASC 2008»
14 years 6 months ago
Undecidability Results for Finite Interactive Systems
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 6 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
SSDBM
2008
IEEE
177views Database» more  SSDBM 2008»
14 years 6 months ago
ELKI: A Software System for Evaluation of Subspace Clustering Algorithms
In order to establish consolidated standards in novel data mining areas, newly proposed algorithms need to be evaluated thoroughly. Many publications compare a new proposition – ...
Elke Achtert, Hans-Peter Kriegel, Arthur Zimek
SSDBM
2008
IEEE
95views Database» more  SSDBM 2008»
14 years 6 months ago
Finding Frequent Items over General Update Streams
Abstract. We present novel space and time-efficient algorithms for finding frequent items over general update streams. Our algorithms are based on a novel adaptation of the popula...
Sumit Ganguly, Abhayendra N. Singh, Satyam Shankar
PRDC
2008
IEEE
14 years 6 months ago
On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
Julien Clement, Thomas Hérault, Stép...