Sciweavers

1135 search results - page 12 / 227
» Interactive Problem Solving via Algorithm Visualization
Sort
View
ICCS
2005
Springer
15 years 5 months ago
A Visual Interactive Framework for Formal Derivation
We describe a visual interactive framework that supports the computation of syntactic unifiers of expressions with variables. Unification is specified via built-in transformatio...
Paul Agron, Leo Bachmair, Frank Nielsen
97
Voted
CSCLP
2005
Springer
15 years 5 months ago
A Hybrid Benders' Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
Armagan Tarim, Ian Miguel
WWW
2006
ACM
16 years 10 days ago
Visualizing tags over time
We consider the problem of visualizing the evolution of tags within the Flickr (flickr.com) online image sharing community. Any user of the Flickr service may append a tag to any ...
Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine...
84
Voted
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
15 years 6 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 1 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang