Result 1 to 19 of 19 total
Towards temporal controllabilities for workflow schemata (English)
TIME, 129-136 (2010).
1
Controllability in temporal conceptual workflow schemata. (English)
Dayal, Umeshwar (ed.) et al., Business process management. 7th international conference, BPM 2009, Ulm, Germany, September 8‒10, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03847-1/pbk). Lecture Notes in Computer Science 5701, 64-79 (2009).
2
Controllability in temporal conceptual workflow schemata (English)
BPM, 64-79 (2009).
3
Traps and pitfalls of topic-biased PageRank. (English)
Aiello, William (ed.) et al., Algorithms and models for the web-graph. Fourth international workshop, WAW 2006, Banff, Canada, November 30‒December 1, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-78807-2/pbk). Lecture Notes in Computer Science 4936, 107-116 (2008).
4
Solving maximum independent set by asynchronous distributed Hopfield-type neural networks. (English)
Rev. Inform. Teor. Apl. 40, No. 2, 371-388 (2006).
5
Solving maximum independent set by asynchronous distributed Hopfield-type neural networks. (English)
Theor. Inform. Appl. 40, No. 2, 371-388 (2006).
6
Traps and pitfalls of topic-biased pagerank (English)
WAW, 107-116 (2006).
7
Analysis of a genetic model with finite populations (English)
ICNC (3), 235-244 (2005).
8
A framework for the internationalization of data-intensive web applications (English)
ICWE, 478-482 (2004).
9
A distributed algorithm for max independent set problem based on Hopfield networks. (English)
Marinaro, Maria (ed.) et al., Neural nets. 13th Italian workshop, WIRN VIETRI 2002, Vietri sul Mare, Italy, May 30 - June 1, 2002. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2486, 64-74 (2002).
10
A distributed algorithm for Max independent set problem based on Hopfield networks (English)
WIRN, 64-74 (2002).
11
A new lower bound on approximability of the ground state problem for tridimensional Ising spin glasses. (English)
Inf. Process. Lett. 68, No.4, 167-171 (1998).
12
A schema-based approach to modeling and querying WWW data (English)
FQAS, 110-125 (1998).
13
A neural algorithm for MAX-2SAT: Performance analysis and circuit implementation. (English)
Neural Netw. 10, No. 3, 555-560 (1997).
14
A neural algorithm for MAX-2SAT: Performance analysis and circuit implementation. (English)
Neural Netw. 10, No. 3, 555-560 (1997).
15
Approximability of the ground state problem for certain Ising spin glasses. (English)
J. Complexity 13, No.3, 326-339 (1997).
16
An upper bound for the maximum cut mean value. (English)
Möhring, Rolf H. (ed.), Graph-theoretic concepts in computer science. 23rd international workshop, WG ’97, Berlin, Germany, June 18‒20, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1335, 78-84 (1997).
17
An upper bound for the maximum cut mean value (English)
WG, 78-84 (1997).
18
A neural circuit for the maximum 2-satisfiability problem (English)
PDP, 319-323 (1995).
19
Result 1 to 19 of 19 total
Start
Contact
Print
General Help
