Sciweavers

14386 search results - page 345 / 2878
» The Chinese Generals Problem
Sort
View
ICALP
2010
Springer
15 years 11 months ago
The Positive Semidefinite Grothendieck Problem with Rank Constraint
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Jop Briët, Fernando Mário de Oliveira ...
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
15 years 10 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
GECCO
2006
Springer
172views Optimization» more  GECCO 2006»
15 years 10 months ago
Multi-objective optimisation of the protein-ligand docking problem in drug discovery
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...
A. Oduguwa, A. Tiwari, S. Fiorentino, R. Roy
176
Voted
ICIA
2007
15 years 8 months ago
A Decision-Theoretic Model of Assistance - Evaluation, Extensions and Open Problems
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...
Sriraam Natarajan, Kshitij Judah, Prasad Tadepalli...
DIMEA
2008
122views Multimedia» more  DIMEA 2008»
15 years 8 months ago
Multiplayer role games applied to problem based learning
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...
Pilar Sancho, Pedro Pablo Gómez-Martí...