IJOE
2008
13 years 4 months ago
2008
Objectives of Automation courses are knowledge and know-how transfer to students. It is important for learner to control locally or remotely real systems composed of many sensors a...
ECCC
2006
13 years 4 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
COR
2006
13 years 4 months ago
2006
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
CCE
2006
13 years 4 months ago
2006
There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main go...
CCE
2006
13 years 4 months ago
2006
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
BMCBI
2006
13 years 4 months ago
2006
Motivation Protein remote homology prediction and fold recognition are central problems in computational biology. Supervised learning algorithms based on support vector machines a...
EOR
2008
13 years 4 months ago
2008
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and...
APAL
2006
13 years 4 months ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
AMC
2006
13 years 4 months ago
2006
In this paper, the decision making problems with the dependence and the feedback effects are considered. Although the analytic network/hierarchy process (ANP/AHP) has been propose...
EAAI
2008
13 years 4 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...