Sciweavers

2107 search results - page 174 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
158
Voted
CIKM
2006
Springer
15 years 7 months ago
Coupling feature selection and machine learning methods for navigational query identification
It is important yet hard to identify navigational queries in Web search due to a lack of sufficient information in Web queries, which are typically very short. In this paper we st...
Yumao Lu, Fuchun Peng, Xin Li, Nawaaz Ahmed
AAAI
1990
15 years 4 months ago
A Hierarchical Planner that Generates Its Own Hierarchies
PABLO' is a nonlinear planner that reasons hially by generating abstract predicates. PABLO's abstract search spaces are generated automatically using predicate relaxatio...
Jens Christensen
COR
2007
80views more  COR 2007»
15 years 3 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
ACNS
2005
Springer
97views Cryptology» more  ACNS 2005»
15 years 9 months ago
Thompson's Group and Public Key Cryptography
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
Vladimir Shpilrain, Alexander Ushakov
CSC
2010
14 years 10 months ago
Performance Modeling, Analysis, and Optimization of Cell-List Based Molecular Dynamics
- We have developed a performance prediction model for non-bonded interaction computations in molecular dynamics simulations, thereby predicting the optimal cell dimension in a lin...
Manaschai Kunaseth, Rajiv K. Kalia, Aiichiro Nakan...