8780 search results - page 229 / 1756 » On the Feasibility of Consistent Computations |
170
click to vote
SAT
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
189
click to vote
IJCNN
2006
IEEE
16 years 1 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
159
click to vote
ICIC
2005
Springer
16 years 23 days ago
2005
Springer
Associativity, auto-reversibility and question-answering are the three intrinsic functions to be investigated for the proposed Q’tron Neural Network (NN) model. A Q’tron NN pos...
181
click to vote
ECRTS
2003
IEEE
16 years 16 days ago
2003
IEEE
When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing req...
174
click to vote
ICRA
1998
IEEE
15 years 11 months ago
1998
IEEE
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...