Sciweavers

160 search results - page 12 / 32
» Definition and Complexity of Some Basic Metareasoning Proble...
Sort
View
OOIS
2001
Springer
13 years 12 months ago
Towards a Requirements Engineering Process Model
The creation of a development process is a challenging task. The application, customization and refinement of generic process models into fine-grained process steps suitable for a...
Armin Eberlein, Li Jiang
MP
2006
137views more  MP 2006»
13 years 7 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
TEC
2008
93views more  TEC 2008»
13 years 7 months ago
The Self-Organization of Interaction Networks for Nature-Inspired Optimization
Over the last decade, significant progress has been made in understanding complex biological systems, however there have been few attempts at incorporating this knowledge into natu...
James M. Whitacre, Ruhul A. Sarker, Q. Tuan Pham
AAAI
2012
11 years 10 months ago
Transfer Learning with Graph Co-Regularization
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
Mingsheng Long, Jianmin Wang 0001, Guiguang Ding, ...
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 2 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli