Sciweavers

1816 search results - page 55 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ANOR
2005
72views more  ANOR 2005»
14 years 11 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
IJCAI
1989
15 years 1 months ago
An Algebraic Approach to Constraint Satisfaction Problems
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
Igor Rivin, Ramin Zabih
AAAI
2004
15 years 1 months ago
Solving Concurrent Markov Decision Processes
Typically, Markov decision problems (MDPs) assume a single action is executed per decision epoch, but in the real world one may frequently execute certain actions in parallel. Thi...
Mausam, Daniel S. Weld
UAI
2004
15 years 1 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby
GRAPHITE
2004
ACM
15 years 5 months ago
A new fractal-based approach for 3D visualization of mountains in VRML standard
Several factors currently limit the size of Virtual Reality Modeling Language (VRML) models that can be effectively visualized over the Web. Main factors include network bandwidth...
Mohsen Sharifi, Fatemeh Hashemi Golpaygani, Mehdi ...