Sciweavers

16504 search results - page 76 / 3301
» New Problems, New Solutions
Sort
View
AAAI
2004
15 years 7 months ago
Domain Transmutation in Constraint Satisfaction Problems
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
James Bowen, Chavalit Likitvivatanavong
IPPS
2007
IEEE
16 years 18 days ago
A hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem
This work presents a new hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem (DRCTSP). The most important differences between the new EA and...
André Renato Villela da Silva, Luiz Satoru ...
ICASSP
2008
IEEE
16 years 22 days ago
Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
Yuzhe Jin, Bhaskar D. Rao
CVPR
2007
IEEE
16 years 8 months ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
ASSETS
2010
ACM
15 years 4 months ago
Accessibility by demonstration: enabling end users to guide developers to web accessibility solutions
Few web developers have been explicitly trained to create accessible web pages, and are unlikely to recognize subtle accessibility and usability concerns that disabled people face...
Jeffrey P. Bigham, Jeremy T. Brudvik, Bernie Zhang