Sciweavers

789 search results - page 12 / 158
» Solving Complex Problems Efficiently with Adaptive Automata
Sort
View
EOR
2008
103views more  EOR 2008»
13 years 7 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
IJCAI
1989
13 years 8 months ago
Functional Representation of Designs and Redesign Problem Solving
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de­ sign task takes as input the specifications of the desired functions of a device...
Ashok K. Goel, B. Chandrasekaran
CSB
2005
IEEE
210views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Problem Solving Environment Approach to Integrating Diverse Biological Data Sources
Scientists face an ever-increasing challenge in investigating biological systems with high throughput experimental methods such as mass spectrometry and gene arrays because of the...
Eric G. Stephan, Kyle R. Klicker, Mudita Singhal, ...
ATAL
2008
Springer
13 years 9 months ago
Decentralised Structural Adaptation in Agent Organisations
Abstract. Autonomic computing is being advocated as a tool for maintaining and managing large, complex computing systems. Self-organising multi-agent systems provide a suitable par...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...
IPPS
2003
IEEE
14 years 24 days ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...