14158 search results - page 312 / 2832 » Generalized switch-setting problems |
145
click to vote
ESA
1997
Springer
15 years 8 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
148
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
The pharmaceutical industry is facing an ever-increasing demand to discover novel drugs that are more effective and safer than existing ones. The industry faces huge problem in im...
149
click to vote
ICIA
2007
15 years 6 months ago
2007
There is a growing interest in intelligent assistants for a variety of applications from organizing tasks for knowledge workers to helping people with dementia. In our earlier wor...
143
click to vote
DIMEA
2008
15 years 6 months ago
2008
The educational community is willing to approach the learning applications to the engaging and immersive formats of multimedia and video games as a way of increasing the motivatio...
134
click to vote
STRINGOLOGY
2004
15 years 5 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...