Sciweavers

SCCC
1998
IEEE
13 years 12 months ago
An Adaptive Model for Programming Distributed Real-Time Applications in CORBA
CORBA is a middleware with open standardization that is receiving plenty of acceptance for facilitating the distributed objects programming. CORBA is being extended through the sp...
Carlos Montez, Rômulo Silva de Oliveira, Jon...
SCCC
1998
IEEE
13 years 12 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
SCCC
1998
IEEE
13 years 12 months ago
Software Architectural Specification for Optimal Object Distribution
Software architectural design is essential for complex distributed applications. Architectural specifications need to define the key aspects of the application, including its inte...
M. Cecilia Bastarrica, Steven A. Demurjian, Alexan...
SCCC
1998
IEEE
13 years 12 months ago
The Use of Agents Techniques on Intelligent Tutoring Systems
Lúcia Maria Martins Giraffa, Rosa Maria Vic...
WG
1999
Springer
13 years 12 months ago
Finding Smallest Supertrees Under Minor Containment
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...
WG
1999
Springer
13 years 12 months ago
Euler is Standing in Line
Dietrich Hauptmeier, Sven Oliver Krumke, Jörg...
WG
1999
Springer
13 years 12 months ago
Linear Orderings of Random Geometric Graphs
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
Josep Díaz, Mathew D. Penrose, Jordi Petit,...
TLCA
1999
Springer
13 years 12 months ago
Strong Normalisation of Cut-Elimination in Classical Logic
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
Christian Urban, Gavin M. Bierman