Sciweavers

3663 search results - page 498 / 733
» Problems in the ontology of computer programs
Sort
View
RT
1995
Springer
15 years 10 months ago
Making Global Illumination User-friendly
Global illumination researchers tend to think in terms of mesh density and sampling frequency, and their software reflects this in its user interface. Advanced rendering systems a...
Gregory J. Ward
168
Voted
AIIDE
2008
15 years 9 months ago
An Intelligent IDE for Behavior Authoring in Real-Time Strategy Games
Behavior authoring for computer games involves writing behaviors in a programming language and then iteratively refining them by detecting issues with them. The main bottlenecks a...
Suhas Virmani, Yatin Kanetkar, Manish Mehta, Santi...
ISMB
2000
15 years 8 months ago
A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations
The next phase of human genomics will involve largescale screens of populations for signi cant DNA polymorphisms, notably single nucleotide polymorphisms SNP's. Dense human S...
Dan Gusfield
ICML
2010
IEEE
15 years 7 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
COR
2008
99views more  COR 2008»
15 years 6 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi