Sciweavers

2850 search results - page 343 / 570
» On Timed Models and Full Abstraction
Sort
View
TLCA
2007
Springer
16 years 24 days ago
Predicative Analysis of Feasibility and Diagonalization
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
Jean-Yves Marion
147
Voted
CEC
2005
IEEE
16 years 10 days ago
A simple hybrid evolutionary algorithm for finding Golomb rulers
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
Iván Dotú, Pascal Van Hentenryck
ILP
2005
Springer
16 years 6 days ago
Strategies to Parallelize ILP Systems
Abstract. It is well known by Inductive Logic Programming (ILP) practioners that ILP systems usually take a long time to find valuable models (theories). The problem is specially ...
Nuno A. Fonseca, Fernando M. A. Silva, Rui Camacho
ICTAC
2004
Springer
16 years 2 days ago
Replicative - Distribution Rules in P Systems with Active Membranes
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
Tseren-Onolt Ishdorj, Mihai Ionescu
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
16 years 2 days ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad