Sciweavers

292 search results - page 21 / 59
» Are Stable Instances Easy
Sort
View
WWW
2011
ACM
15 years 27 days ago
OntoTrix: a hybrid visualization for populated ontologies
Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology’s vocabulary. Insta...
Benjamin Bach, Emmanuel Pietriga, Ilaria Liccardi,...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 9 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
Javier G. Marín-Blázquez, Sonia Schu...
CP
2009
Springer
16 years 22 days ago
Using Relaxations in Maximum Density Still Life
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la...
ICSEA
2009
IEEE
16 years 18 days ago
Rule-Based Service Modeling
— In the context of service-oriented computing, services provide the capabilities necessary to support the business, especially its processes. Within the service modeling process...
Michael Gebhart, Sebastian Abeck
CDC
2008
IEEE
16 years 13 days ago
Wireless control of passive systems subject to actuator constraints
Abstract— Actuator constraints such as saturation can impose severe constraints on networked control systems. For instance delays in wireless control systems of unstable plants c...
Nicholas Kottenstette, Panos J. Antsaklis