Sciweavers

717 search results - page 111 / 144
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
14 years 7 months ago
A multi-objective approach to data sharing with privacy constraints and preference based objectives
Public data sharing is utilized in a number of businesses to facilitate the exchange of information. Privacy constraints are usually enforced to prevent unwanted inference of info...
Rinku Dewri, Darrell Whitley, Indrajit Ray, Indrak...
TOG
2002
133views more  TOG 2002»
14 years 9 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
SAC
2003
ACM
15 years 3 months ago
reality: a Scalable Intelligent Travel Planner
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...
Marc Torrens, Patrick Hertzog, Loic Samson, Boi Fa...
DAC
2008
ACM
15 years 10 months ago
Faster symmetry discovery using sparsity of symmetries
Many computational tools have recently begun to benefit from the use of the symmetry inherent in the tasks they solve, and use general-purpose graph symmetry tools to uncover this...
Paul T. Darga, Karem A. Sakallah, Igor L. Markov
DAM
2008
115views more  DAM 2008»
14 years 9 months ago
Variable space search for graph coloring
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
Alain Hertz, Matthieu Plumettaz, Nicolas Zufferey