Sciweavers

16843 search results - page 430 / 3369
» On Generalized Authorization Problems
Sort
View
ICALP
2001
Springer
15 years 11 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 10 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
ACSC
2008
IEEE
15 years 8 months ago
An investigation of the state formation and transition limitations for prediction problems in recurrent neural networks
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
Angel Kennedy, Cara MacNish
CEC
2005
IEEE
15 years 8 months ago
Co-evolutionary modular neural networks for automatic problem decomposition
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
Vineet R. Khare, Xin Yao, Bernhard Sendhoff, Yaoch...
180
Voted
IJCAI
2007
15 years 8 months ago
Handling Alternative Activities in Resource-Constrained Project Scheduling Problems
In the context of operative disruption management, decision support systems have to evaluate the typically manifold options of responding to disturbances: The temporal shift of ac...
Jürgen Kuster, Dietmar Jannach, Gerhard Fried...