Sciweavers

2152 search results - page 63 / 431
» A Comparative Study of 2QBF Algorithms
Sort
View
CEC
2008
IEEE
15 years 6 months ago
A study on constrained MA using GA and SQP: Analytical vs. finite-difference gradients
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
SIGIR
2009
ACM
15 years 6 months ago
Dynamicity vs. effectiveness: studying online clustering for scatter/gather
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
Weimao Ke, Cassidy R. Sugimoto, Javed Mostafa
DIAGRAMS
2006
Springer
15 years 3 months ago
Exploring the Effect of Animation and Progressive Revealing on Diagrammatic Problem Solving
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
Daesub Yoon, N. Hari Narayanan, SooCheol Lee, Oh-C...
ICANN
2009
Springer
15 years 4 months ago
On the Knowledge Organization in Concept Formation: An Exploratory Cognitive Modeling Study
Abstract. Recent cognitive modeling studies suggest the effectiveness of metaheuristic optimization in describing human cognitive behaviors. Such models are built on the basis of p...
Toshihiko Matsuka, Hidehito Honda, Arieta Chouchou...
FCCM
2005
IEEE
139views VLSI» more  FCCM 2005»
15 years 5 months ago
A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation
Just-in-time (JIT) compilation has been used in many applications to enable standard software binaries to execute on different underlying processor architectures. We previously in...
Roman L. Lysecky, Frank Vahid, Sheldon X.-D. Tan