Sciweavers

14518 search results - page 248 / 2904
» Two Problems for Sophistication
Sort
View
108
Voted
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
15 years 4 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ļ...
Samir Siksek, Michael Stoll
118
Voted
FPL
2006
Springer
208views Hardware» more  FPL 2006»
15 years 4 months ago
Implementation in Fpgas of Jacobi Method to Solve the Eigenvalue and Eigenvector Problem
This work shows a modular architecture based on FPGA's to solve the eigenvalue problem according to the Jacobi method. This method is able to solve the eigenvalues and eigenv...
Ignacio Bravo, Pedro Jiménez, Manuel Mazo, ...
107
Voted
ICML
1998
IEEE
15 years 4 months ago
The Problem with Noise and Small Disjuncts
Many systems that learn from examples express the learned concept as a disjunction. Those disjuncts that cover only a few examples are referred to as small disjuncts. The problem ...
Gary M. Weiss, Haym Hirsh
AIPS
2007
15 years 3 months ago
Temporally-Expressive Planning as Constraint Satisfaction Problems
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at...
Yuxiao Hu
79
Voted
FLAIRS
2003
15 years 2 months ago
On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings