Sciweavers

8413 search results - page 426 / 1683
» Ordering Problem Subgoals
Sort
View
IPPS
2005
IEEE
16 years 9 days ago
Code-Size Minimization in Multiprocessor Real-Time Systems
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...
Sanjoy K. Baruah, Nathan Fisher
SIBGRAPI
2005
IEEE
16 years 9 days ago
A Linear Algorithm for Exact Pattern Matching in Planar Subdivisions
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
Pedro Ribeiro de Andrade Neto, André Luiz P...
272
Voted
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
16 years 8 days ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
ICCBR
2005
Springer
16 years 7 days ago
Evaluating the Effectiveness of Exploration and Accumulated Experience in Automatic Case Elicitation
Non-learning problem solvers have been applied to many interesting and complex domains. Experience-based learning techniques have been developed to augment the capabilities of cert...
Jay H. Powell, Brandon M. Hauff, John D. Hastings
ISMIS
2005
Springer
16 years 7 days ago
Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
Manos Papagelis, Ioannis Rousidis, Dimitris Plexou...